/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:56:50,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:56:50,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:56:50,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:56:50,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:56:50,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:56:50,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:56:50,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:56:50,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:56:50,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:56:50,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:56:50,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:56:50,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:56:50,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:56:50,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:56:50,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:56:50,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:56:50,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:56:50,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:56:50,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:56:50,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:56:50,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:56:50,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:56:50,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:56:50,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:56:50,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:56:50,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:56:50,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:56:50,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:56:50,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:56:50,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:56:50,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:56:50,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:56:50,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:56:50,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:56:50,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:56:50,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:56:50,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:56:50,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:56:50,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:56:50,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:56:50,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:56:50,284 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:56:50,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:56:50,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:56:50,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:56:50,286 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:56:50,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:56:50,287 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:56:50,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:56:50,287 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:56:50,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:56:50,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:56:50,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:56:50,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:56:50,288 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:56:50,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:56:50,289 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:56:50,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:56:50,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:56:50,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:56:50,289 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:56:50,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:56:50,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:56:50,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:56:50,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:56:50,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:56:50,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:56:50,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:56:50,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:56:50,291 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:56:50,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:56:50,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:56:50,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:56:50,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:56:50,575 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:56:50,575 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:56:50,576 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i [2019-12-26 23:56:50,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8cf5fb7/e6152d638bc24fde974c895e81a07bb3/FLAG2417f4e72 [2019-12-26 23:56:51,234 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:56:51,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i [2019-12-26 23:56:51,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8cf5fb7/e6152d638bc24fde974c895e81a07bb3/FLAG2417f4e72 [2019-12-26 23:56:51,530 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8cf5fb7/e6152d638bc24fde974c895e81a07bb3 [2019-12-26 23:56:51,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:56:51,541 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:56:51,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:56:51,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:56:51,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:56:51,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:56:51" (1/1) ... [2019-12-26 23:56:51,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:51, skipping insertion in model container [2019-12-26 23:56:51,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:56:51" (1/1) ... [2019-12-26 23:56:51,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:56:51,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:56:52,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:56:52,189 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:56:52,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:56:52,327 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:56:52,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:52 WrapperNode [2019-12-26 23:56:52,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:56:52,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:56:52,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:56:52,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:56:52,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:52" (1/1) ... [2019-12-26 23:56:52,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:52" (1/1) ... [2019-12-26 23:56:52,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:56:52,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:56:52,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:56:52,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:56:52,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:52" (1/1) ... [2019-12-26 23:56:52,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:52" (1/1) ... [2019-12-26 23:56:52,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:52" (1/1) ... [2019-12-26 23:56:52,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:52" (1/1) ... [2019-12-26 23:56:52,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:52" (1/1) ... [2019-12-26 23:56:52,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:52" (1/1) ... [2019-12-26 23:56:52,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:52" (1/1) ... [2019-12-26 23:56:52,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:56:52,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:56:52,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:56:52,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:56:52,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:56:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:56:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:56:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:56:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:56:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:56:52,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:56:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:56:52,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:56:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:56:52,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:56:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:56:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:56:52,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:56:52,525 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:56:53,272 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:56:53,273 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:56:53,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:56:53 BoogieIcfgContainer [2019-12-26 23:56:53,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:56:53,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:56:53,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:56:53,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:56:53,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:56:51" (1/3) ... [2019-12-26 23:56:53,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdd4a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:56:53, skipping insertion in model container [2019-12-26 23:56:53,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:52" (2/3) ... [2019-12-26 23:56:53,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdd4a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:56:53, skipping insertion in model container [2019-12-26 23:56:53,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:56:53" (3/3) ... [2019-12-26 23:56:53,283 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_pso.oepc.i [2019-12-26 23:56:53,294 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:56:53,294 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:56:53,302 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:56:53,303 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:56:53,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,348 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,348 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,394 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,395 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,422 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,423 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,423 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,427 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,431 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,433 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:53,457 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:56:53,477 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:56:53,478 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:56:53,478 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:56:53,478 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:56:53,478 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:56:53,478 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:56:53,478 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:56:53,478 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:56:53,496 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-26 23:56:53,498 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 23:56:53,601 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 23:56:53,601 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:56:53,619 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:56:53,645 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 23:56:53,700 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 23:56:53,700 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:56:53,709 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:56:53,730 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 23:56:53,731 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:56:59,217 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 23:56:59,339 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 23:56:59,781 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-26 23:56:59,781 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-26 23:56:59,786 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-26 23:57:18,506 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-26 23:57:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-26 23:57:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:57:18,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:18,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:57:18,515 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:18,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:18,520 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-26 23:57:18,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:18,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601665317] [2019-12-26 23:57:18,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:18,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601665317] [2019-12-26 23:57:18,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:18,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:57:18,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721869827] [2019-12-26 23:57:18,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:57:18,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:18,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:57:18,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:57:18,813 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-26 23:57:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:20,324 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-26 23:57:20,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:57:20,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:57:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:20,952 INFO L225 Difference]: With dead ends: 110910 [2019-12-26 23:57:20,952 INFO L226 Difference]: Without dead ends: 98066 [2019-12-26 23:57:20,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:57:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-26 23:57:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-26 23:57:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-26 23:57:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-26 23:57:32,343 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-26 23:57:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:32,344 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-26 23:57:32,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:57:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-26 23:57:32,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:57:32,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:32,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:32,356 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:32,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-26 23:57:32,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:32,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687520992] [2019-12-26 23:57:32,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:32,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687520992] [2019-12-26 23:57:32,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:32,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:57:32,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228908309] [2019-12-26 23:57:32,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:57:32,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:32,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:57:32,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:57:32,509 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-26 23:57:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:33,749 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-26 23:57:33,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:57:33,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:57:33,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:39,294 INFO L225 Difference]: With dead ends: 156656 [2019-12-26 23:57:39,294 INFO L226 Difference]: Without dead ends: 156558 [2019-12-26 23:57:39,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:57:43,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-26 23:57:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-26 23:57:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-26 23:57:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-26 23:57:47,396 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-26 23:57:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:47,397 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-26 23:57:47,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:57:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-26 23:57:47,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:57:47,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:47,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:47,401 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:47,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:47,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-26 23:57:47,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:47,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208273140] [2019-12-26 23:57:47,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:47,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208273140] [2019-12-26 23:57:47,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:47,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:57:47,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164447972] [2019-12-26 23:57:47,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:57:47,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:47,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:57:47,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:57:47,466 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-26 23:57:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:47,593 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-26 23:57:47,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:57:47,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:57:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:47,658 INFO L225 Difference]: With dead ends: 31386 [2019-12-26 23:57:47,658 INFO L226 Difference]: Without dead ends: 31386 [2019-12-26 23:57:47,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:57:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-26 23:57:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-26 23:57:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-26 23:57:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-26 23:57:49,367 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-26 23:57:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:49,367 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-26 23:57:49,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:57:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-26 23:57:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:57:49,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:49,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:49,371 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:49,372 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-26 23:57:49,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:49,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584922213] [2019-12-26 23:57:49,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:49,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584922213] [2019-12-26 23:57:49,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:49,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:57:49,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658391578] [2019-12-26 23:57:49,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:57:49,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:49,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:57:49,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:57:49,479 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-26 23:57:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:49,997 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-26 23:57:49,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:57:49,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 23:57:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:50,079 INFO L225 Difference]: With dead ends: 43205 [2019-12-26 23:57:50,080 INFO L226 Difference]: Without dead ends: 43205 [2019-12-26 23:57:50,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:57:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-26 23:57:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-26 23:57:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-26 23:57:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-26 23:57:51,462 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-26 23:57:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:51,464 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-26 23:57:51,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:57:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-26 23:57:51,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:57:51,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:51,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:51,474 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:51,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:51,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-26 23:57:51,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:51,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001007892] [2019-12-26 23:57:51,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:51,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001007892] [2019-12-26 23:57:51,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:51,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:57:51,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008855374] [2019-12-26 23:57:51,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:57:51,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:51,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:57:51,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:57:51,575 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-26 23:57:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:52,470 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-26 23:57:52,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:57:52,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 23:57:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:52,561 INFO L225 Difference]: With dead ends: 56051 [2019-12-26 23:57:52,561 INFO L226 Difference]: Without dead ends: 56037 [2019-12-26 23:57:52,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:57:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-26 23:57:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-26 23:57:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-26 23:57:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-26 23:57:53,342 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-26 23:57:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:53,342 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-26 23:57:53,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:57:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-26 23:57:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:57:53,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:53,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:53,357 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:53,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:53,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-26 23:57:53,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:53,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464075938] [2019-12-26 23:57:53,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:53,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464075938] [2019-12-26 23:57:53,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:53,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:57:53,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435521284] [2019-12-26 23:57:53,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:57:53,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:53,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:57:53,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:57:53,427 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-26 23:57:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:53,497 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-26 23:57:53,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:57:53,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:57:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:53,518 INFO L225 Difference]: With dead ends: 15281 [2019-12-26 23:57:53,518 INFO L226 Difference]: Without dead ends: 15281 [2019-12-26 23:57:53,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:57:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-26 23:57:54,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-26 23:57:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-26 23:57:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-26 23:57:54,065 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-26 23:57:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:54,066 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-26 23:57:54,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:57:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-26 23:57:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 23:57:54,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:54,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:54,076 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-26 23:57:54,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:54,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088384161] [2019-12-26 23:57:54,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:54,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088384161] [2019-12-26 23:57:54,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:54,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:57:54,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793340593] [2019-12-26 23:57:54,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:57:54,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:54,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:57:54,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:57:54,163 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-26 23:57:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:54,712 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-26 23:57:54,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:57:54,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 23:57:54,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:54,749 INFO L225 Difference]: With dead ends: 21679 [2019-12-26 23:57:54,750 INFO L226 Difference]: Without dead ends: 21679 [2019-12-26 23:57:54,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:57:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-26 23:57:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-26 23:57:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-26 23:57:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-26 23:57:55,041 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-26 23:57:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:55,042 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-26 23:57:55,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:57:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-26 23:57:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 23:57:55,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:55,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:55,060 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:55,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-26 23:57:55,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:55,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504844161] [2019-12-26 23:57:55,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:55,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504844161] [2019-12-26 23:57:55,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:55,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:57:55,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348500429] [2019-12-26 23:57:55,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:57:55,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:55,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:57:55,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:57:55,216 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 8 states. [2019-12-26 23:57:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:56,466 INFO L93 Difference]: Finished difference Result 24561 states and 72020 transitions. [2019-12-26 23:57:56,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 23:57:56,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-26 23:57:56,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:56,501 INFO L225 Difference]: With dead ends: 24561 [2019-12-26 23:57:56,501 INFO L226 Difference]: Without dead ends: 24561 [2019-12-26 23:57:56,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:57:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24561 states. [2019-12-26 23:57:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24561 to 17437. [2019-12-26 23:57:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17437 states. [2019-12-26 23:57:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17437 states to 17437 states and 52503 transitions. [2019-12-26 23:57:56,818 INFO L78 Accepts]: Start accepts. Automaton has 17437 states and 52503 transitions. Word has length 33 [2019-12-26 23:57:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:56,818 INFO L462 AbstractCegarLoop]: Abstraction has 17437 states and 52503 transitions. [2019-12-26 23:57:56,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:57:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 17437 states and 52503 transitions. [2019-12-26 23:57:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 23:57:56,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:56,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:56,837 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash -147828206, now seen corresponding path program 2 times [2019-12-26 23:57:56,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:56,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357381664] [2019-12-26 23:57:56,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:56,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357381664] [2019-12-26 23:57:56,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:56,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:57:56,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788748454] [2019-12-26 23:57:56,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:57:56,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:56,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:57:56,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:57:56,977 INFO L87 Difference]: Start difference. First operand 17437 states and 52503 transitions. Second operand 7 states. [2019-12-26 23:57:58,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:58,151 INFO L93 Difference]: Finished difference Result 24299 states and 71228 transitions. [2019-12-26 23:57:58,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:57:58,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 23:57:58,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:58,184 INFO L225 Difference]: With dead ends: 24299 [2019-12-26 23:57:58,184 INFO L226 Difference]: Without dead ends: 24299 [2019-12-26 23:57:58,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:57:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24299 states. [2019-12-26 23:57:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24299 to 16666. [2019-12-26 23:57:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-26 23:57:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-26 23:57:58,475 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-26 23:57:58,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:58,475 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-26 23:57:58,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:57:58,475 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-26 23:57:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 23:57:58,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:58,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:58,496 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-26 23:57:58,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:58,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860146166] [2019-12-26 23:57:58,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:58,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860146166] [2019-12-26 23:57:58,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:58,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:57:58,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818323359] [2019-12-26 23:57:58,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:57:58,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:58,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:57:58,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:57:58,558 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 3 states. [2019-12-26 23:57:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:58,622 INFO L93 Difference]: Finished difference Result 16665 states and 50148 transitions. [2019-12-26 23:57:58,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:57:58,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 23:57:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:58,653 INFO L225 Difference]: With dead ends: 16665 [2019-12-26 23:57:58,653 INFO L226 Difference]: Without dead ends: 16665 [2019-12-26 23:57:58,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:57:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16665 states. [2019-12-26 23:57:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16665 to 16665. [2019-12-26 23:57:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2019-12-26 23:57:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 50148 transitions. [2019-12-26 23:57:58,922 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 50148 transitions. Word has length 39 [2019-12-26 23:57:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:58,922 INFO L462 AbstractCegarLoop]: Abstraction has 16665 states and 50148 transitions. [2019-12-26 23:57:58,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:57:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 50148 transitions. [2019-12-26 23:57:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:57:58,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:58,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:58,942 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:58,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1450973103, now seen corresponding path program 1 times [2019-12-26 23:57:58,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:58,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520282027] [2019-12-26 23:57:58,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:58,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520282027] [2019-12-26 23:57:58,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:58,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:57:58,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500957755] [2019-12-26 23:57:58,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:57:58,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:58,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:57:58,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:57:58,999 INFO L87 Difference]: Start difference. First operand 16665 states and 50148 transitions. Second operand 4 states. [2019-12-26 23:57:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:59,096 INFO L93 Difference]: Finished difference Result 31503 states and 94864 transitions. [2019-12-26 23:57:59,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:57:59,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-26 23:57:59,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:59,120 INFO L225 Difference]: With dead ends: 31503 [2019-12-26 23:57:59,121 INFO L226 Difference]: Without dead ends: 16332 [2019-12-26 23:57:59,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:57:59,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16332 states. [2019-12-26 23:57:59,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16332 to 16328. [2019-12-26 23:57:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2019-12-26 23:57:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 48458 transitions. [2019-12-26 23:57:59,357 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 48458 transitions. Word has length 40 [2019-12-26 23:57:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:59,357 INFO L462 AbstractCegarLoop]: Abstraction has 16328 states and 48458 transitions. [2019-12-26 23:57:59,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:57:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 48458 transitions. [2019-12-26 23:57:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:57:59,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:59,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:59,374 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:59,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:59,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1753570543, now seen corresponding path program 2 times [2019-12-26 23:57:59,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:59,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590312894] [2019-12-26 23:57:59,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:59,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590312894] [2019-12-26 23:57:59,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:59,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:57:59,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275699287] [2019-12-26 23:57:59,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:57:59,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:57:59,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:57:59,453 INFO L87 Difference]: Start difference. First operand 16328 states and 48458 transitions. Second operand 5 states. [2019-12-26 23:58:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:00,061 INFO L93 Difference]: Finished difference Result 22499 states and 66522 transitions. [2019-12-26 23:58:00,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:58:00,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 23:58:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:00,092 INFO L225 Difference]: With dead ends: 22499 [2019-12-26 23:58:00,093 INFO L226 Difference]: Without dead ends: 22499 [2019-12-26 23:58:00,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:58:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22499 states. [2019-12-26 23:58:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22499 to 21006. [2019-12-26 23:58:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21006 states. [2019-12-26 23:58:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21006 states to 21006 states and 62454 transitions. [2019-12-26 23:58:00,514 INFO L78 Accepts]: Start accepts. Automaton has 21006 states and 62454 transitions. Word has length 40 [2019-12-26 23:58:00,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:00,514 INFO L462 AbstractCegarLoop]: Abstraction has 21006 states and 62454 transitions. [2019-12-26 23:58:00,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:58:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 21006 states and 62454 transitions. [2019-12-26 23:58:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:58:00,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:00,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:00,535 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:00,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:00,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1960596885, now seen corresponding path program 3 times [2019-12-26 23:58:00,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:00,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158935106] [2019-12-26 23:58:00,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:00,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158935106] [2019-12-26 23:58:00,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:00,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:58:00,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595060925] [2019-12-26 23:58:00,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:58:00,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:00,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:58:00,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:58:00,608 INFO L87 Difference]: Start difference. First operand 21006 states and 62454 transitions. Second operand 5 states. [2019-12-26 23:58:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:00,708 INFO L93 Difference]: Finished difference Result 19781 states and 59627 transitions. [2019-12-26 23:58:00,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:58:00,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 23:58:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:00,743 INFO L225 Difference]: With dead ends: 19781 [2019-12-26 23:58:00,743 INFO L226 Difference]: Without dead ends: 19287 [2019-12-26 23:58:00,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:58:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19287 states. [2019-12-26 23:58:01,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19287 to 18447. [2019-12-26 23:58:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18447 states. [2019-12-26 23:58:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 56396 transitions. [2019-12-26 23:58:01,261 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 56396 transitions. Word has length 40 [2019-12-26 23:58:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:01,263 INFO L462 AbstractCegarLoop]: Abstraction has 18447 states and 56396 transitions. [2019-12-26 23:58:01,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:58:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 56396 transitions. [2019-12-26 23:58:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:58:01,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:01,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:01,295 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:01,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:01,295 INFO L82 PathProgramCache]: Analyzing trace with hash -48564843, now seen corresponding path program 1 times [2019-12-26 23:58:01,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:01,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134165686] [2019-12-26 23:58:01,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:01,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134165686] [2019-12-26 23:58:01,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:01,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:58:01,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284140573] [2019-12-26 23:58:01,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:58:01,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:58:01,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:01,364 INFO L87 Difference]: Start difference. First operand 18447 states and 56396 transitions. Second operand 3 states. [2019-12-26 23:58:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:01,512 INFO L93 Difference]: Finished difference Result 27408 states and 83933 transitions. [2019-12-26 23:58:01,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:58:01,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 23:58:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:01,564 INFO L225 Difference]: With dead ends: 27408 [2019-12-26 23:58:01,564 INFO L226 Difference]: Without dead ends: 27408 [2019-12-26 23:58:01,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27408 states. [2019-12-26 23:58:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27408 to 20833. [2019-12-26 23:58:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-26 23:58:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-26 23:58:01,955 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-26 23:58:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:01,955 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-26 23:58:01,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:58:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-26 23:58:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:58:01,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:01,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:01,985 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:01,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 1 times [2019-12-26 23:58:01,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:01,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598555919] [2019-12-26 23:58:01,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:02,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598555919] [2019-12-26 23:58:02,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:02,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:58:02,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071437058] [2019-12-26 23:58:02,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:58:02,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:02,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:58:02,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:58:02,072 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 7 states. [2019-12-26 23:58:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:02,784 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-26 23:58:02,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:58:02,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:58:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:02,856 INFO L225 Difference]: With dead ends: 61323 [2019-12-26 23:58:02,856 INFO L226 Difference]: Without dead ends: 42147 [2019-12-26 23:58:02,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:58:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-26 23:58:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-26 23:58:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-26 23:58:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-26 23:58:03,358 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-26 23:58:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:03,358 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-26 23:58:03,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:58:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-26 23:58:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:58:03,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:03,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:03,397 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:03,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 2 times [2019-12-26 23:58:03,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:03,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490140483] [2019-12-26 23:58:03,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:03,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490140483] [2019-12-26 23:58:03,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:03,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:58:03,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060298187] [2019-12-26 23:58:03,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:58:03,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:03,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:58:03,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:58:03,480 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 7 states. [2019-12-26 23:58:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:04,070 INFO L93 Difference]: Finished difference Result 68574 states and 211095 transitions. [2019-12-26 23:58:04,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 23:58:04,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:58:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:04,148 INFO L225 Difference]: With dead ends: 68574 [2019-12-26 23:58:04,148 INFO L226 Difference]: Without dead ends: 51641 [2019-12-26 23:58:04,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:58:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51641 states. [2019-12-26 23:58:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51641 to 27716. [2019-12-26 23:58:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-26 23:58:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-26 23:58:04,754 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-26 23:58:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:04,754 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-26 23:58:04,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:58:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-26 23:58:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:58:04,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:04,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:04,783 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:04,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:04,784 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 3 times [2019-12-26 23:58:04,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:04,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190655756] [2019-12-26 23:58:04,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:04,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190655756] [2019-12-26 23:58:04,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:04,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:58:04,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113649160] [2019-12-26 23:58:04,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:58:04,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:04,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:58:04,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:58:04,872 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 7 states. [2019-12-26 23:58:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:05,477 INFO L93 Difference]: Finished difference Result 58876 states and 180784 transitions. [2019-12-26 23:58:05,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:58:05,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:58:05,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:05,555 INFO L225 Difference]: With dead ends: 58876 [2019-12-26 23:58:05,555 INFO L226 Difference]: Without dead ends: 51661 [2019-12-26 23:58:05,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:58:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51661 states. [2019-12-26 23:58:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51661 to 28024. [2019-12-26 23:58:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-26 23:58:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-26 23:58:06,164 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-26 23:58:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:06,165 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-26 23:58:06,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:58:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-26 23:58:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:58:06,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:06,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:06,196 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:06,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:06,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 4 times [2019-12-26 23:58:06,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:06,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185064954] [2019-12-26 23:58:06,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:06,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185064954] [2019-12-26 23:58:06,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:06,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:58:06,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812221791] [2019-12-26 23:58:06,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:58:06,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:06,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:58:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:06,252 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-26 23:58:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:06,411 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-26 23:58:06,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:58:06,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 23:58:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:06,458 INFO L225 Difference]: With dead ends: 33789 [2019-12-26 23:58:06,458 INFO L226 Difference]: Without dead ends: 33789 [2019-12-26 23:58:06,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:06,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-26 23:58:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-26 23:58:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-26 23:58:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-26 23:58:06,957 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-26 23:58:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:06,957 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-26 23:58:06,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:58:06,958 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-26 23:58:06,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:06,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:06,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:06,990 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:06,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:06,991 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-26 23:58:06,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:06,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855606886] [2019-12-26 23:58:06,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:07,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855606886] [2019-12-26 23:58:07,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:07,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:58:07,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063389546] [2019-12-26 23:58:07,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:58:07,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:07,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:58:07,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:58:07,049 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-26 23:58:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:07,552 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-26 23:58:07,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:58:07,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 23:58:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:07,620 INFO L225 Difference]: With dead ends: 45817 [2019-12-26 23:58:07,620 INFO L226 Difference]: Without dead ends: 45817 [2019-12-26 23:58:07,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:58:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-26 23:58:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-26 23:58:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-26 23:58:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-26 23:58:08,231 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-26 23:58:08,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:08,232 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-26 23:58:08,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:58:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-26 23:58:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:08,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:08,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:08,266 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:08,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:08,267 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-26 23:58:08,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:08,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608642775] [2019-12-26 23:58:08,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:08,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608642775] [2019-12-26 23:58:08,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:08,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:58:08,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061421314] [2019-12-26 23:58:08,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:58:08,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:08,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:58:08,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:58:08,356 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 7 states. [2019-12-26 23:58:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:09,007 INFO L93 Difference]: Finished difference Result 69632 states and 216004 transitions. [2019-12-26 23:58:09,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:58:09,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:58:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:09,107 INFO L225 Difference]: With dead ends: 69632 [2019-12-26 23:58:09,107 INFO L226 Difference]: Without dead ends: 63631 [2019-12-26 23:58:09,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:58:09,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63631 states. [2019-12-26 23:58:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63631 to 31991. [2019-12-26 23:58:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31991 states. [2019-12-26 23:58:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31991 states to 31991 states and 100515 transitions. [2019-12-26 23:58:10,215 INFO L78 Accepts]: Start accepts. Automaton has 31991 states and 100515 transitions. Word has length 65 [2019-12-26 23:58:10,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:10,215 INFO L462 AbstractCegarLoop]: Abstraction has 31991 states and 100515 transitions. [2019-12-26 23:58:10,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:58:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 31991 states and 100515 transitions. [2019-12-26 23:58:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:10,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:10,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:10,250 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:10,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:10,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1336640005, now seen corresponding path program 2 times [2019-12-26 23:58:10,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:10,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231279258] [2019-12-26 23:58:10,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:10,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231279258] [2019-12-26 23:58:10,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:10,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:58:10,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690166181] [2019-12-26 23:58:10,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:58:10,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:10,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:58:10,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:58:10,359 INFO L87 Difference]: Start difference. First operand 31991 states and 100515 transitions. Second operand 7 states. [2019-12-26 23:58:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:11,144 INFO L93 Difference]: Finished difference Result 44848 states and 139960 transitions. [2019-12-26 23:58:11,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:58:11,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:58:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:11,212 INFO L225 Difference]: With dead ends: 44848 [2019-12-26 23:58:11,212 INFO L226 Difference]: Without dead ends: 44844 [2019-12-26 23:58:11,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:58:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44844 states. [2019-12-26 23:58:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44844 to 32249. [2019-12-26 23:58:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32249 states. [2019-12-26 23:58:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32249 states to 32249 states and 99750 transitions. [2019-12-26 23:58:11,858 INFO L78 Accepts]: Start accepts. Automaton has 32249 states and 99750 transitions. Word has length 65 [2019-12-26 23:58:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:11,858 INFO L462 AbstractCegarLoop]: Abstraction has 32249 states and 99750 transitions. [2019-12-26 23:58:11,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:58:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 32249 states and 99750 transitions. [2019-12-26 23:58:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:11,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:11,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:11,899 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:11,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-26 23:58:11,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:11,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795244955] [2019-12-26 23:58:11,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:11,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795244955] [2019-12-26 23:58:11,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:11,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:58:11,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767344791] [2019-12-26 23:58:11,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:58:11,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:11,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:58:11,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:11,947 INFO L87 Difference]: Start difference. First operand 32249 states and 99750 transitions. Second operand 3 states. [2019-12-26 23:58:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:12,323 INFO L93 Difference]: Finished difference Result 43160 states and 132643 transitions. [2019-12-26 23:58:12,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:58:12,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:58:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:12,412 INFO L225 Difference]: With dead ends: 43160 [2019-12-26 23:58:12,412 INFO L226 Difference]: Without dead ends: 43160 [2019-12-26 23:58:12,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2019-12-26 23:58:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 32489. [2019-12-26 23:58:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32489 states. [2019-12-26 23:58:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32489 states to 32489 states and 100545 transitions. [2019-12-26 23:58:13,378 INFO L78 Accepts]: Start accepts. Automaton has 32489 states and 100545 transitions. Word has length 65 [2019-12-26 23:58:13,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:13,379 INFO L462 AbstractCegarLoop]: Abstraction has 32489 states and 100545 transitions. [2019-12-26 23:58:13,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:58:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 32489 states and 100545 transitions. [2019-12-26 23:58:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:13,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:13,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:13,418 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:13,419 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-26 23:58:13,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:13,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818860183] [2019-12-26 23:58:13,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:13,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818860183] [2019-12-26 23:58:13,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:13,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:58:13,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565700766] [2019-12-26 23:58:13,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:58:13,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:13,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:58:13,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:58:13,518 INFO L87 Difference]: Start difference. First operand 32489 states and 100545 transitions. Second operand 7 states. [2019-12-26 23:58:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:14,336 INFO L93 Difference]: Finished difference Result 52071 states and 162140 transitions. [2019-12-26 23:58:14,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:58:14,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:58:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:14,447 INFO L225 Difference]: With dead ends: 52071 [2019-12-26 23:58:14,448 INFO L226 Difference]: Without dead ends: 52071 [2019-12-26 23:58:14,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:58:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52071 states. [2019-12-26 23:58:15,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52071 to 33507. [2019-12-26 23:58:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33507 states. [2019-12-26 23:58:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33507 states to 33507 states and 103713 transitions. [2019-12-26 23:58:15,708 INFO L78 Accepts]: Start accepts. Automaton has 33507 states and 103713 transitions. Word has length 65 [2019-12-26 23:58:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:15,708 INFO L462 AbstractCegarLoop]: Abstraction has 33507 states and 103713 transitions. [2019-12-26 23:58:15,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:58:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 33507 states and 103713 transitions. [2019-12-26 23:58:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:15,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:15,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:15,763 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:15,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:15,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1008271868, now seen corresponding path program 1 times [2019-12-26 23:58:15,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:15,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668719545] [2019-12-26 23:58:15,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:15,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668719545] [2019-12-26 23:58:15,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:15,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:58:15,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598584078] [2019-12-26 23:58:15,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:58:15,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:15,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:58:15,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:58:15,855 INFO L87 Difference]: Start difference. First operand 33507 states and 103713 transitions. Second operand 4 states. [2019-12-26 23:58:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:16,075 INFO L93 Difference]: Finished difference Result 33507 states and 103505 transitions. [2019-12-26 23:58:16,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:58:16,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 23:58:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:16,129 INFO L225 Difference]: With dead ends: 33507 [2019-12-26 23:58:16,129 INFO L226 Difference]: Without dead ends: 33507 [2019-12-26 23:58:16,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:58:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-12-26 23:58:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 28069. [2019-12-26 23:58:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28069 states. [2019-12-26 23:58:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28069 states to 28069 states and 85930 transitions. [2019-12-26 23:58:16,600 INFO L78 Accepts]: Start accepts. Automaton has 28069 states and 85930 transitions. Word has length 65 [2019-12-26 23:58:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:16,601 INFO L462 AbstractCegarLoop]: Abstraction has 28069 states and 85930 transitions. [2019-12-26 23:58:16,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:58:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 28069 states and 85930 transitions. [2019-12-26 23:58:16,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:16,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:16,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:16,634 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:16,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:16,634 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-26 23:58:16,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:16,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928689655] [2019-12-26 23:58:16,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:16,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928689655] [2019-12-26 23:58:16,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:16,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:58:16,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631267882] [2019-12-26 23:58:16,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:58:16,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:16,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:58:16,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:58:16,708 INFO L87 Difference]: Start difference. First operand 28069 states and 85930 transitions. Second operand 5 states. [2019-12-26 23:58:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:17,435 INFO L93 Difference]: Finished difference Result 40500 states and 121827 transitions. [2019-12-26 23:58:17,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:58:17,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:58:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:17,491 INFO L225 Difference]: With dead ends: 40500 [2019-12-26 23:58:17,492 INFO L226 Difference]: Without dead ends: 40276 [2019-12-26 23:58:17,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:58:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states. [2019-12-26 23:58:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 32300. [2019-12-26 23:58:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32300 states. [2019-12-26 23:58:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32300 states to 32300 states and 98642 transitions. [2019-12-26 23:58:18,032 INFO L78 Accepts]: Start accepts. Automaton has 32300 states and 98642 transitions. Word has length 65 [2019-12-26 23:58:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:18,032 INFO L462 AbstractCegarLoop]: Abstraction has 32300 states and 98642 transitions. [2019-12-26 23:58:18,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:58:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 32300 states and 98642 transitions. [2019-12-26 23:58:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:18,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:18,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:18,067 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:18,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-26 23:58:18,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:18,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011020704] [2019-12-26 23:58:18,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:18,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011020704] [2019-12-26 23:58:18,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:18,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:58:18,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081022934] [2019-12-26 23:58:18,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:58:18,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:18,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:58:18,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:58:18,279 INFO L87 Difference]: Start difference. First operand 32300 states and 98642 transitions. Second operand 9 states. [2019-12-26 23:58:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:20,080 INFO L93 Difference]: Finished difference Result 49096 states and 148270 transitions. [2019-12-26 23:58:20,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:58:20,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 23:58:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:20,201 INFO L225 Difference]: With dead ends: 49096 [2019-12-26 23:58:20,201 INFO L226 Difference]: Without dead ends: 49000 [2019-12-26 23:58:20,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:58:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49000 states. [2019-12-26 23:58:20,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49000 to 33469. [2019-12-26 23:58:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33469 states. [2019-12-26 23:58:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33469 states to 33469 states and 102034 transitions. [2019-12-26 23:58:20,930 INFO L78 Accepts]: Start accepts. Automaton has 33469 states and 102034 transitions. Word has length 65 [2019-12-26 23:58:20,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:20,930 INFO L462 AbstractCegarLoop]: Abstraction has 33469 states and 102034 transitions. [2019-12-26 23:58:20,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:58:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 33469 states and 102034 transitions. [2019-12-26 23:58:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:20,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:20,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:20,968 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash 312846933, now seen corresponding path program 3 times [2019-12-26 23:58:20,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:20,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598472921] [2019-12-26 23:58:20,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:21,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598472921] [2019-12-26 23:58:21,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:21,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:58:21,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101265726] [2019-12-26 23:58:21,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:58:21,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:21,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:58:21,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:58:21,414 INFO L87 Difference]: Start difference. First operand 33469 states and 102034 transitions. Second operand 10 states. [2019-12-26 23:58:23,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:23,917 INFO L93 Difference]: Finished difference Result 51752 states and 155487 transitions. [2019-12-26 23:58:23,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 23:58:23,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-26 23:58:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:23,993 INFO L225 Difference]: With dead ends: 51752 [2019-12-26 23:58:23,993 INFO L226 Difference]: Without dead ends: 51444 [2019-12-26 23:58:23,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2019-12-26 23:58:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51444 states. [2019-12-26 23:58:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51444 to 36360. [2019-12-26 23:58:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36360 states. [2019-12-26 23:58:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36360 states to 36360 states and 110560 transitions. [2019-12-26 23:58:24,678 INFO L78 Accepts]: Start accepts. Automaton has 36360 states and 110560 transitions. Word has length 65 [2019-12-26 23:58:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:24,678 INFO L462 AbstractCegarLoop]: Abstraction has 36360 states and 110560 transitions. [2019-12-26 23:58:24,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:58:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 36360 states and 110560 transitions. [2019-12-26 23:58:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:24,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:24,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:24,720 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:24,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1178106421, now seen corresponding path program 4 times [2019-12-26 23:58:24,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:24,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131639700] [2019-12-26 23:58:24,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:24,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131639700] [2019-12-26 23:58:24,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:24,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:58:24,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248582075] [2019-12-26 23:58:24,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:58:24,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:24,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:58:24,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:24,791 INFO L87 Difference]: Start difference. First operand 36360 states and 110560 transitions. Second operand 3 states. [2019-12-26 23:58:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:24,971 INFO L93 Difference]: Finished difference Result 36360 states and 110559 transitions. [2019-12-26 23:58:24,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:58:24,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:58:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:25,056 INFO L225 Difference]: With dead ends: 36360 [2019-12-26 23:58:25,056 INFO L226 Difference]: Without dead ends: 36360 [2019-12-26 23:58:25,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36360 states. [2019-12-26 23:58:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36360 to 29373. [2019-12-26 23:58:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29373 states. [2019-12-26 23:58:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29373 states to 29373 states and 91197 transitions. [2019-12-26 23:58:26,051 INFO L78 Accepts]: Start accepts. Automaton has 29373 states and 91197 transitions. Word has length 65 [2019-12-26 23:58:26,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:26,051 INFO L462 AbstractCegarLoop]: Abstraction has 29373 states and 91197 transitions. [2019-12-26 23:58:26,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:58:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 29373 states and 91197 transitions. [2019-12-26 23:58:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:58:26,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:26,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:26,084 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:26,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:26,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1560089001, now seen corresponding path program 1 times [2019-12-26 23:58:26,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:26,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467977868] [2019-12-26 23:58:26,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:26,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467977868] [2019-12-26 23:58:26,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:26,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:58:26,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872380562] [2019-12-26 23:58:26,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:58:26,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:26,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:58:26,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:26,131 INFO L87 Difference]: Start difference. First operand 29373 states and 91197 transitions. Second operand 3 states. [2019-12-26 23:58:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:26,213 INFO L93 Difference]: Finished difference Result 23148 states and 70708 transitions. [2019-12-26 23:58:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:58:26,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:58:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:26,244 INFO L225 Difference]: With dead ends: 23148 [2019-12-26 23:58:26,244 INFO L226 Difference]: Without dead ends: 23148 [2019-12-26 23:58:26,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23148 states. [2019-12-26 23:58:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23148 to 22261. [2019-12-26 23:58:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22261 states. [2019-12-26 23:58:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22261 states to 22261 states and 67922 transitions. [2019-12-26 23:58:26,577 INFO L78 Accepts]: Start accepts. Automaton has 22261 states and 67922 transitions. Word has length 66 [2019-12-26 23:58:26,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:26,577 INFO L462 AbstractCegarLoop]: Abstraction has 22261 states and 67922 transitions. [2019-12-26 23:58:26,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:58:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 22261 states and 67922 transitions. [2019-12-26 23:58:26,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:58:26,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:26,603 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:26,603 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:26,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:26,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-26 23:58:26,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:26,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161897561] [2019-12-26 23:58:26,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:26,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161897561] [2019-12-26 23:58:26,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:26,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:58:26,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948523041] [2019-12-26 23:58:26,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:58:26,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:26,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:58:26,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:58:26,783 INFO L87 Difference]: Start difference. First operand 22261 states and 67922 transitions. Second operand 11 states. [2019-12-26 23:58:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:27,968 INFO L93 Difference]: Finished difference Result 46687 states and 142559 transitions. [2019-12-26 23:58:27,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 23:58:27,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 23:58:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:28,017 INFO L225 Difference]: With dead ends: 46687 [2019-12-26 23:58:28,017 INFO L226 Difference]: Without dead ends: 34941 [2019-12-26 23:58:28,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 23:58:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34941 states. [2019-12-26 23:58:28,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34941 to 22177. [2019-12-26 23:58:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22177 states. [2019-12-26 23:58:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22177 states to 22177 states and 67008 transitions. [2019-12-26 23:58:28,433 INFO L78 Accepts]: Start accepts. Automaton has 22177 states and 67008 transitions. Word has length 67 [2019-12-26 23:58:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:28,434 INFO L462 AbstractCegarLoop]: Abstraction has 22177 states and 67008 transitions. [2019-12-26 23:58:28,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:58:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 22177 states and 67008 transitions. [2019-12-26 23:58:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:58:28,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:28,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:28,456 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 2 times [2019-12-26 23:58:28,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:28,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130870701] [2019-12-26 23:58:28,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:58:28,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130870701] [2019-12-26 23:58:28,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:28,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:58:28,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177776639] [2019-12-26 23:58:28,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:58:28,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:28,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:58:28,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:58:28,662 INFO L87 Difference]: Start difference. First operand 22177 states and 67008 transitions. Second operand 12 states. [2019-12-26 23:58:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:29,649 INFO L93 Difference]: Finished difference Result 35460 states and 106807 transitions. [2019-12-26 23:58:29,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:58:29,649 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 23:58:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:29,700 INFO L225 Difference]: With dead ends: 35460 [2019-12-26 23:58:29,701 INFO L226 Difference]: Without dead ends: 34511 [2019-12-26 23:58:29,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 23:58:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34511 states. [2019-12-26 23:58:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34511 to 21515. [2019-12-26 23:58:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21515 states. [2019-12-26 23:58:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21515 states to 21515 states and 65201 transitions. [2019-12-26 23:58:30,280 INFO L78 Accepts]: Start accepts. Automaton has 21515 states and 65201 transitions. Word has length 67 [2019-12-26 23:58:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:30,281 INFO L462 AbstractCegarLoop]: Abstraction has 21515 states and 65201 transitions. [2019-12-26 23:58:30,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:58:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 21515 states and 65201 transitions. [2019-12-26 23:58:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:58:30,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:30,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:30,301 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:30,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:30,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 3 times [2019-12-26 23:58:30,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:30,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502350777] [2019-12-26 23:58:30,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:58:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:58:30,410 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:58:30,410 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:58:30,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= 0 v_~__unbuffered_p2_EAX~0_45) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_26|)) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_26| 1)) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2287~0.base_26|) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_26|) |v_ULTIMATE.start_main_~#t2287~0.offset_19| 0))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2287~0.base_26| 4)) (= 0 |v_ULTIMATE.start_main_~#t2287~0.offset_19|) (= v_~z$r_buff1_thd0~0_133 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ULTIMATE.start_main_~#t2287~0.base=|v_ULTIMATE.start_main_~#t2287~0.base_26|, ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_19|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2287~0.offset=|v_ULTIMATE.start_main_~#t2287~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ULTIMATE.start_main_~#t2289~0.offset, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2288~0.offset, ULTIMATE.start_main_~#t2289~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2287~0.base, #NULL.base, ULTIMATE.start_main_~#t2287~0.offset, ULTIMATE.start_main_~#t2288~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-26 23:58:30,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2288~0.base_9| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2288~0.base_9| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9|) |v_ULTIMATE.start_main_~#t2288~0.offset_8| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2288~0.offset_8|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2288~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2288~0.offset] because there is no mapped edge [2019-12-26 23:58:30,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= 1 ~z$w_buff0_used~0_Out2082691407) (= P0Thread1of1ForFork0_~arg.offset_Out2082691407 |P0Thread1of1ForFork0_#in~arg.offset_In2082691407|) (= |P0Thread1of1ForFork0_#in~arg.base_In2082691407| P0Thread1of1ForFork0_~arg.base_Out2082691407) (= 1 ~z$w_buff0~0_Out2082691407) (= ~z$w_buff1_used~0_Out2082691407 ~z$w_buff0_used~0_In2082691407) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out2082691407| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out2082691407) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out2082691407|) (= 0 (mod ~z$w_buff1_used~0_Out2082691407 256)) (= ~z$w_buff1~0_Out2082691407 ~z$w_buff0~0_In2082691407)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In2082691407|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2082691407, ~z$w_buff0~0=~z$w_buff0~0_In2082691407, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In2082691407|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In2082691407|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out2082691407, ~z$w_buff0~0=~z$w_buff0~0_Out2082691407, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out2082691407, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out2082691407, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In2082691407|, ~z$w_buff1~0=~z$w_buff1~0_Out2082691407, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out2082691407, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out2082691407|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out2082691407} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 23:58:30,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11|) |v_ULTIMATE.start_main_~#t2289~0.offset_9| 2)) |v_#memory_int_15|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2289~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2289~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2289~0.offset, #length, ULTIMATE.start_main_~#t2289~0.base] because there is no mapped edge [2019-12-26 23:58:30,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-288861651 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-288861651 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-288861651| |P1Thread1of1ForFork1_#t~ite10_Out-288861651|))) (or (and (not .cse0) .cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-288861651| ~z$w_buff1~0_In-288861651) (not .cse2)) (and (or .cse0 .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out-288861651| ~z~0_In-288861651) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-288861651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-288861651, ~z$w_buff1~0=~z$w_buff1~0_In-288861651, ~z~0=~z~0_In-288861651} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-288861651|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-288861651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-288861651, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-288861651|, ~z$w_buff1~0=~z$w_buff1~0_In-288861651, ~z~0=~z~0_In-288861651} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-26 23:58:30,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1168137436 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1168137436 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1168137436|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1168137436| ~z$w_buff0_used~0_In-1168137436)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1168137436, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1168137436} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1168137436, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1168137436|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1168137436} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:58:30,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In594348825 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In594348825 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In594348825 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In594348825 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out594348825|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In594348825 |P1Thread1of1ForFork1_#t~ite12_Out594348825|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In594348825, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In594348825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In594348825, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In594348825} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In594348825, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In594348825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In594348825, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out594348825|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In594348825} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:58:30,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1563114868 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1563114868 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out1563114868| ~z$r_buff0_thd2~0_In1563114868) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out1563114868| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1563114868, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1563114868} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1563114868, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1563114868|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1563114868} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:58:30,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-759429261 256) 0))) (or (and (= ~z$w_buff1~0_In-759429261 |P2Thread1of1ForFork2_#t~ite24_Out-759429261|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-759429261| |P2Thread1of1ForFork2_#t~ite23_Out-759429261|)) (and (= ~z$w_buff1~0_In-759429261 |P2Thread1of1ForFork2_#t~ite23_Out-759429261|) (= |P2Thread1of1ForFork2_#t~ite23_Out-759429261| |P2Thread1of1ForFork2_#t~ite24_Out-759429261|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-759429261 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-759429261 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-759429261 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In-759429261 256)) .cse1)))))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-759429261|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-759429261, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-759429261, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-759429261, ~z$w_buff1~0=~z$w_buff1~0_In-759429261, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-759429261, ~weak$$choice2~0=~weak$$choice2~0_In-759429261} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-759429261|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-759429261|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-759429261, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-759429261, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-759429261, ~z$w_buff1~0=~z$w_buff1~0_In-759429261, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-759429261, ~weak$$choice2~0=~weak$$choice2~0_In-759429261} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-26 23:58:30,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In880472357 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In880472357 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In880472357 256) 0) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In880472357 256)) .cse0) (= (mod ~z$w_buff0_used~0_In880472357 256) 0))) (= ~z$w_buff0_used~0_In880472357 |P2Thread1of1ForFork2_#t~ite26_Out880472357|) (= |P2Thread1of1ForFork2_#t~ite26_Out880472357| |P2Thread1of1ForFork2_#t~ite27_Out880472357|) .cse1) (and (not .cse1) (= ~z$w_buff0_used~0_In880472357 |P2Thread1of1ForFork2_#t~ite27_Out880472357|) (= |P2Thread1of1ForFork2_#t~ite26_In880472357| |P2Thread1of1ForFork2_#t~ite26_Out880472357|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In880472357|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In880472357, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In880472357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In880472357, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In880472357, ~weak$$choice2~0=~weak$$choice2~0_In880472357} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out880472357|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In880472357, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In880472357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In880472357, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In880472357, ~weak$$choice2~0=~weak$$choice2~0_In880472357, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out880472357|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-26 23:58:30,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-114734470 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-114734470 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-114734470 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-114734470 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-114734470|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-114734470 |P1Thread1of1ForFork1_#t~ite14_Out-114734470|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-114734470, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-114734470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-114734470, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-114734470} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-114734470, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-114734470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-114734470, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-114734470|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-114734470} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:58:30,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:58:30,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-993080485 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-993080485 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-993080485 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-993080485 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-993080485 256)) .cse0))) (= |P2Thread1of1ForFork2_#t~ite30_Out-993080485| |P2Thread1of1ForFork2_#t~ite29_Out-993080485|) (= ~z$w_buff1_used~0_In-993080485 |P2Thread1of1ForFork2_#t~ite29_Out-993080485|) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite29_In-993080485| |P2Thread1of1ForFork2_#t~ite29_Out-993080485|) (not .cse1) (= ~z$w_buff1_used~0_In-993080485 |P2Thread1of1ForFork2_#t~ite30_Out-993080485|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-993080485, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-993080485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-993080485, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-993080485, ~weak$$choice2~0=~weak$$choice2~0_In-993080485, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-993080485|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-993080485|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-993080485, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-993080485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-993080485, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-993080485, ~weak$$choice2~0=~weak$$choice2~0_In-993080485, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-993080485|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-26 23:58:30,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 23:58:30,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 23:58:30,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In107181005 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In107181005 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In107181005 |P0Thread1of1ForFork0_#t~ite5_Out107181005|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out107181005|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In107181005, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In107181005} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out107181005|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In107181005, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In107181005} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:58:30,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1448184205 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1448184205 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1448184205 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1448184205 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1448184205 |P0Thread1of1ForFork0_#t~ite6_Out-1448184205|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1448184205|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1448184205, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1448184205, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1448184205, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1448184205} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1448184205|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1448184205, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1448184205, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1448184205, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1448184205} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:58:30,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1084723576 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1084723576 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out1084723576) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In1084723576 ~z$r_buff0_thd1~0_Out1084723576) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1084723576, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1084723576} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1084723576, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1084723576|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1084723576} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:58:30,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-911451648 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-911451648 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-911451648 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-911451648 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-911451648|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In-911451648 |P0Thread1of1ForFork0_#t~ite8_Out-911451648|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-911451648, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-911451648, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-911451648, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-911451648} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-911451648, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-911451648|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-911451648, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-911451648, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-911451648} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:58:30,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:58:30,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork2_#t~ite39_Out-1685175423| |P2Thread1of1ForFork2_#t~ite38_Out-1685175423|)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1685175423 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1685175423 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out-1685175423| ~z~0_In-1685175423)) (and .cse2 (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out-1685175423| ~z$w_buff1~0_In-1685175423)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1685175423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1685175423, ~z$w_buff1~0=~z$w_buff1~0_In-1685175423, ~z~0=~z~0_In-1685175423} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1685175423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1685175423, ~z$w_buff1~0=~z$w_buff1~0_In-1685175423, ~z~0=~z~0_In-1685175423, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1685175423|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1685175423|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-26 23:58:30,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2015406696 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2015406696 256) 0))) (or (and (= ~z$w_buff0_used~0_In-2015406696 |P2Thread1of1ForFork2_#t~ite40_Out-2015406696|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-2015406696|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2015406696, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2015406696} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2015406696, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2015406696, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-2015406696|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-26 23:58:30,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In13054458 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In13054458 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In13054458 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In13054458 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out13054458|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In13054458 |P2Thread1of1ForFork2_#t~ite41_Out13054458|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In13054458, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In13054458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In13054458, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In13054458} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out13054458|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In13054458, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In13054458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In13054458, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In13054458} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-26 23:58:30,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In2038970272 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2038970272 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out2038970272|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out2038970272| ~z$r_buff0_thd3~0_In2038970272)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2038970272, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2038970272} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out2038970272|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2038970272, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2038970272} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-26 23:58:30,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-872095199 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-872095199 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-872095199 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-872095199 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-872095199 |P2Thread1of1ForFork2_#t~ite43_Out-872095199|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-872095199| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-872095199, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-872095199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-872095199, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-872095199} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-872095199, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-872095199, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-872095199|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-872095199, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-872095199} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-26 23:58:30,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:58:30,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:58:30,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1940405924 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1940405924 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1940405924| |ULTIMATE.start_main_#t~ite47_Out-1940405924|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1940405924| ~z$w_buff1~0_In-1940405924) (not .cse1) .cse2) (and (or .cse1 .cse0) (= ~z~0_In-1940405924 |ULTIMATE.start_main_#t~ite47_Out-1940405924|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1940405924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1940405924, ~z$w_buff1~0=~z$w_buff1~0_In-1940405924, ~z~0=~z~0_In-1940405924} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1940405924, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1940405924|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1940405924, ~z$w_buff1~0=~z$w_buff1~0_In-1940405924, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1940405924|, ~z~0=~z~0_In-1940405924} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:58:30,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In943483395 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In943483395 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out943483395| ~z$w_buff0_used~0_In943483395) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out943483395| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In943483395, ~z$w_buff0_used~0=~z$w_buff0_used~0_In943483395} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In943483395, ~z$w_buff0_used~0=~z$w_buff0_used~0_In943483395, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out943483395|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 23:58:30,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-578712299 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-578712299 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-578712299 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-578712299 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-578712299|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-578712299 |ULTIMATE.start_main_#t~ite50_Out-578712299|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-578712299, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-578712299, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-578712299, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-578712299} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-578712299|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-578712299, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-578712299, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-578712299, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-578712299} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 23:58:30,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2069843247 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2069843247 256)))) (or (and (= ~z$r_buff0_thd0~0_In2069843247 |ULTIMATE.start_main_#t~ite51_Out2069843247|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out2069843247|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2069843247, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2069843247} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2069843247, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2069843247|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2069843247} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 23:58:30,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1513547133 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1513547133 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1513547133 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1513547133 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1513547133| ~z$r_buff1_thd0~0_In-1513547133)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-1513547133| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1513547133, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1513547133, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1513547133, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1513547133} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1513547133|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1513547133, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1513547133, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1513547133, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1513547133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 23:58:30,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_~x~0_49 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:58:30,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:58:30 BasicIcfg [2019-12-26 23:58:30,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:58:30,549 INFO L168 Benchmark]: Toolchain (without parser) took 99008.98 ms. Allocated memory was 138.4 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-26 23:58:30,552 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:58:30,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.97 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 156.0 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:58:30,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.43 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:58:30,553 INFO L168 Benchmark]: Boogie Preprocessor took 39.94 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:58:30,553 INFO L168 Benchmark]: RCFGBuilder took 836.20 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 101.1 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:58:30,556 INFO L168 Benchmark]: TraceAbstraction took 97272.17 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-26 23:58:30,559 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.97 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 156.0 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.43 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.94 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.20 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 101.1 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97272.17 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2289, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 96.9s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6792 SDtfs, 8267 SDslu, 20640 SDs, 0 SdLazy, 10719 SolverSat, 393 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 55 SyntacticMatches, 25 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 38.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 302404 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1579 NumberOfCodeBlocks, 1579 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1481 ConstructedInterpolants, 0 QuantifiedInterpolants, 277529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...