/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:29:35,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:29:35,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:29:35,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:29:35,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:29:35,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:29:35,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:29:35,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:29:35,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:29:35,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:29:35,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:29:35,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:29:35,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:29:35,447 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:29:35,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:29:35,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:29:35,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:29:35,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:29:35,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:29:35,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:29:35,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:29:35,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:29:35,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:29:35,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:29:35,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:29:35,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:29:35,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:29:35,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:29:35,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:29:35,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:29:35,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:29:35,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:29:35,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:29:35,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:29:35,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:29:35,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:29:35,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:29:35,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:29:35,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:29:35,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:29:35,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:29:35,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:29:35,487 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:29:35,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:29:35,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:29:35,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:29:35,489 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:29:35,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:29:35,489 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:29:35,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:29:35,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:29:35,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:29:35,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:29:35,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:29:35,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:29:35,491 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:29:35,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:29:35,491 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:29:35,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:29:35,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:29:35,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:29:35,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:29:35,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:29:35,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:29:35,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:29:35,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:29:35,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:29:35,493 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:29:35,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:29:35,493 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:29:35,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:29:35,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:29:35,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:29:35,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:29:35,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:29:35,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:29:35,781 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:29:35,782 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i [2019-12-18 20:29:35,850 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c6e9160d/e398535633b640c38d46ea7754f21831/FLAGabb57091d [2019-12-18 20:29:36,412 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:29:36,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i [2019-12-18 20:29:36,436 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c6e9160d/e398535633b640c38d46ea7754f21831/FLAGabb57091d [2019-12-18 20:29:36,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c6e9160d/e398535633b640c38d46ea7754f21831 [2019-12-18 20:29:36,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:29:36,751 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:29:36,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:29:36,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:29:36,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:29:36,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:29:36" (1/1) ... [2019-12-18 20:29:36,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f2a089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:36, skipping insertion in model container [2019-12-18 20:29:36,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:29:36" (1/1) ... [2019-12-18 20:29:36,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:29:36,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:29:37,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:29:37,329 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:29:37,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:29:37,478 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:29:37,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:37 WrapperNode [2019-12-18 20:29:37,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:29:37,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:29:37,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:29:37,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:29:37,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:37" (1/1) ... [2019-12-18 20:29:37,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:37" (1/1) ... [2019-12-18 20:29:37,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:29:37,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:29:37,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:29:37,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:29:37,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:37" (1/1) ... [2019-12-18 20:29:37,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:37" (1/1) ... [2019-12-18 20:29:37,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:37" (1/1) ... [2019-12-18 20:29:37,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:37" (1/1) ... [2019-12-18 20:29:37,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:37" (1/1) ... [2019-12-18 20:29:37,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:37" (1/1) ... [2019-12-18 20:29:37,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:37" (1/1) ... [2019-12-18 20:29:37,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:29:37,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:29:37,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:29:37,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:29:37,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:37" (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-18 20:29:37,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:29:37,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:29:37,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:29:37,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:29:37,677 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:29:37,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:29:37,678 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:29:37,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:29:37,678 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:29:37,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:29:37,679 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 20:29:37,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 20:29:37,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:29:37,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:29:37,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:29:37,681 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:29:38,419 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:29:38,419 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:29:38,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:29:38 BoogieIcfgContainer [2019-12-18 20:29:38,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:29:38,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:29:38,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:29:38,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:29:38,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:29:36" (1/3) ... [2019-12-18 20:29:38,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6f0590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:29:38, skipping insertion in model container [2019-12-18 20:29:38,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:29:37" (2/3) ... [2019-12-18 20:29:38,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6f0590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:29:38, skipping insertion in model container [2019-12-18 20:29:38,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:29:38" (3/3) ... [2019-12-18 20:29:38,429 INFO L109 eAbstractionObserver]: Analyzing ICFG mix017_rmo.opt.i [2019-12-18 20:29:38,440 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:29:38,440 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:29:38,448 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:29:38,449 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:29:38,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,496 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,498 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,499 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,548 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,548 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,548 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,549 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,555 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,555 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,564 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,565 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,568 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,569 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,573 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,576 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,579 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,579 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,579 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:29:38,595 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 20:29:38,615 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:29:38,615 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:29:38,615 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:29:38,616 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:29:38,616 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:29:38,616 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:29:38,616 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:29:38,616 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:29:38,633 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 20:29:38,635 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 20:29:38,719 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 20:29:38,719 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:29:38,741 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:29:38,777 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 20:29:38,826 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 20:29:38,827 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:29:38,840 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:29:38,867 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 20:29:38,868 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:29:42,870 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 20:29:43,016 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 20:29:43,039 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74863 [2019-12-18 20:29:43,039 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-18 20:29:43,043 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 94 transitions [2019-12-18 20:30:18,013 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 165606 states. [2019-12-18 20:30:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 165606 states. [2019-12-18 20:30:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:30:18,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:18,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:18,023 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:18,029 INFO L82 PathProgramCache]: Analyzing trace with hash -285837663, now seen corresponding path program 1 times [2019-12-18 20:30:18,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:18,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948265351] [2019-12-18 20:30:18,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:18,267 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-18 20:30:18,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948265351] [2019-12-18 20:30:18,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:18,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:30:18,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659159287] [2019-12-18 20:30:18,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:30:18,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:30:18,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:30:18,287 INFO L87 Difference]: Start difference. First operand 165606 states. Second operand 3 states. [2019-12-18 20:30:23,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:23,230 INFO L93 Difference]: Finished difference Result 163626 states and 782690 transitions. [2019-12-18 20:30:23,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:30:23,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:30:23,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:24,068 INFO L225 Difference]: With dead ends: 163626 [2019-12-18 20:30:24,068 INFO L226 Difference]: Without dead ends: 154266 [2019-12-18 20:30:24,075 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-18 20:30:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154266 states. [2019-12-18 20:30:36,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154266 to 154266. [2019-12-18 20:30:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154266 states. [2019-12-18 20:30:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154266 states to 154266 states and 736982 transitions. [2019-12-18 20:30:42,373 INFO L78 Accepts]: Start accepts. Automaton has 154266 states and 736982 transitions. Word has length 7 [2019-12-18 20:30:42,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:42,374 INFO L462 AbstractCegarLoop]: Abstraction has 154266 states and 736982 transitions. [2019-12-18 20:30:42,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:30:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 154266 states and 736982 transitions. [2019-12-18 20:30:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:30:42,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:42,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:42,385 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:42,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:42,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1421349496, now seen corresponding path program 1 times [2019-12-18 20:30:42,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:42,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637694911] [2019-12-18 20:30:42,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:42,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-18 20:30:42,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637694911] [2019-12-18 20:30:42,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:42,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:30:42,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187822420] [2019-12-18 20:30:42,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:30:42,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:42,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:30:42,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:30:42,518 INFO L87 Difference]: Start difference. First operand 154266 states and 736982 transitions. Second operand 4 states. [2019-12-18 20:30:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:45,420 INFO L93 Difference]: Finished difference Result 243762 states and 1119228 transitions. [2019-12-18 20:30:45,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:30:45,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 20:30:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:54,245 INFO L225 Difference]: With dead ends: 243762 [2019-12-18 20:30:54,245 INFO L226 Difference]: Without dead ends: 243552 [2019-12-18 20:30:54,246 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-18 20:31:00,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243552 states. [2019-12-18 20:31:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243552 to 227200. [2019-12-18 20:31:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227200 states. [2019-12-18 20:31:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227200 states to 227200 states and 1051313 transitions. [2019-12-18 20:31:15,390 INFO L78 Accepts]: Start accepts. Automaton has 227200 states and 1051313 transitions. Word has length 15 [2019-12-18 20:31:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:15,391 INFO L462 AbstractCegarLoop]: Abstraction has 227200 states and 1051313 transitions. [2019-12-18 20:31:15,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:31:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 227200 states and 1051313 transitions. [2019-12-18 20:31:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:31:15,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:15,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:31:15,396 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:15,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:15,396 INFO L82 PathProgramCache]: Analyzing trace with hash 965433143, now seen corresponding path program 1 times [2019-12-18 20:31:15,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:15,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754851309] [2019-12-18 20:31:15,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:15,460 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-18 20:31:15,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754851309] [2019-12-18 20:31:15,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:15,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:31:15,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113718672] [2019-12-18 20:31:15,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:31:15,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:15,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:31:15,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:31:15,466 INFO L87 Difference]: Start difference. First operand 227200 states and 1051313 transitions. Second operand 3 states. [2019-12-18 20:31:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:16,171 INFO L93 Difference]: Finished difference Result 141525 states and 590029 transitions. [2019-12-18 20:31:16,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:31:16,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 20:31:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:16,855 INFO L225 Difference]: With dead ends: 141525 [2019-12-18 20:31:16,855 INFO L226 Difference]: Without dead ends: 141525 [2019-12-18 20:31:16,856 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-18 20:31:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141525 states. [2019-12-18 20:31:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141525 to 141525. [2019-12-18 20:31:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141525 states. [2019-12-18 20:31:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141525 states to 141525 states and 590029 transitions. [2019-12-18 20:31:33,307 INFO L78 Accepts]: Start accepts. Automaton has 141525 states and 590029 transitions. Word has length 15 [2019-12-18 20:31:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:33,307 INFO L462 AbstractCegarLoop]: Abstraction has 141525 states and 590029 transitions. [2019-12-18 20:31:33,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:31:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 141525 states and 590029 transitions. [2019-12-18 20:31:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:31:33,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:33,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:31:33,312 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:33,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:33,312 INFO L82 PathProgramCache]: Analyzing trace with hash 353132370, now seen corresponding path program 1 times [2019-12-18 20:31:33,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:33,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567580665] [2019-12-18 20:31:33,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:33,380 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-18 20:31:33,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567580665] [2019-12-18 20:31:33,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:33,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:31:33,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91235585] [2019-12-18 20:31:33,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:31:33,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:33,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:31:33,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:31:33,383 INFO L87 Difference]: Start difference. First operand 141525 states and 590029 transitions. Second operand 4 states. [2019-12-18 20:31:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:33,594 INFO L93 Difference]: Finished difference Result 38307 states and 135561 transitions. [2019-12-18 20:31:33,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:31:33,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:31:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:33,700 INFO L225 Difference]: With dead ends: 38307 [2019-12-18 20:31:33,700 INFO L226 Difference]: Without dead ends: 38307 [2019-12-18 20:31:33,700 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-18 20:31:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38307 states. [2019-12-18 20:31:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38307 to 38307. [2019-12-18 20:31:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38307 states. [2019-12-18 20:31:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38307 states to 38307 states and 135561 transitions. [2019-12-18 20:31:34,427 INFO L78 Accepts]: Start accepts. Automaton has 38307 states and 135561 transitions. Word has length 16 [2019-12-18 20:31:34,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:34,428 INFO L462 AbstractCegarLoop]: Abstraction has 38307 states and 135561 transitions. [2019-12-18 20:31:34,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:31:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 38307 states and 135561 transitions. [2019-12-18 20:31:34,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:31:34,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:34,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:31:34,431 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:34,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:34,431 INFO L82 PathProgramCache]: Analyzing trace with hash 155833959, now seen corresponding path program 1 times [2019-12-18 20:31:34,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:34,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703990036] [2019-12-18 20:31:34,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:39,247 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-18 20:31:39,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703990036] [2019-12-18 20:31:39,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:39,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:31:39,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721694686] [2019-12-18 20:31:39,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:31:39,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:39,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:31:39,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:31:39,249 INFO L87 Difference]: Start difference. First operand 38307 states and 135561 transitions. Second operand 4 states. [2019-12-18 20:31:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:39,636 INFO L93 Difference]: Finished difference Result 48375 states and 169656 transitions. [2019-12-18 20:31:39,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:31:39,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:31:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:39,731 INFO L225 Difference]: With dead ends: 48375 [2019-12-18 20:31:39,731 INFO L226 Difference]: Without dead ends: 48364 [2019-12-18 20:31:39,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:31:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48364 states. [2019-12-18 20:31:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48364 to 42700. [2019-12-18 20:31:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42700 states. [2019-12-18 20:31:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42700 states to 42700 states and 150756 transitions. [2019-12-18 20:31:40,569 INFO L78 Accepts]: Start accepts. Automaton has 42700 states and 150756 transitions. Word has length 16 [2019-12-18 20:31:40,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:40,569 INFO L462 AbstractCegarLoop]: Abstraction has 42700 states and 150756 transitions. [2019-12-18 20:31:40,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:31:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 42700 states and 150756 transitions. [2019-12-18 20:31:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 20:31:40,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:40,585 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] [2019-12-18 20:31:40,586 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2135022272, now seen corresponding path program 1 times [2019-12-18 20:31:40,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:40,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210238137] [2019-12-18 20:31:40,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:40,701 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-18 20:31:40,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210238137] [2019-12-18 20:31:40,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:40,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:31:40,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638309801] [2019-12-18 20:31:40,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:31:40,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:40,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:31:40,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:31:40,704 INFO L87 Difference]: Start difference. First operand 42700 states and 150756 transitions. Second operand 5 states. [2019-12-18 20:31:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:41,660 INFO L93 Difference]: Finished difference Result 53510 states and 186118 transitions. [2019-12-18 20:31:41,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:31:41,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 20:31:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:41,769 INFO L225 Difference]: With dead ends: 53510 [2019-12-18 20:31:41,769 INFO L226 Difference]: Without dead ends: 53487 [2019-12-18 20:31:41,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:31:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53487 states. [2019-12-18 20:31:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53487 to 42005. [2019-12-18 20:31:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42005 states. [2019-12-18 20:31:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42005 states to 42005 states and 148074 transitions. [2019-12-18 20:31:42,614 INFO L78 Accepts]: Start accepts. Automaton has 42005 states and 148074 transitions. Word has length 24 [2019-12-18 20:31:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:42,615 INFO L462 AbstractCegarLoop]: Abstraction has 42005 states and 148074 transitions. [2019-12-18 20:31:42,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:31:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 42005 states and 148074 transitions. [2019-12-18 20:31:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:31:42,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:42,636 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] [2019-12-18 20:31:42,636 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:42,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:42,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1706816570, now seen corresponding path program 1 times [2019-12-18 20:31:42,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:42,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042138373] [2019-12-18 20:31:42,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:42,698 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-18 20:31:42,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042138373] [2019-12-18 20:31:42,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:42,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:31:42,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720567254] [2019-12-18 20:31:42,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:31:42,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:31:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:31:42,700 INFO L87 Difference]: Start difference. First operand 42005 states and 148074 transitions. Second operand 5 states. [2019-12-18 20:31:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:42,847 INFO L93 Difference]: Finished difference Result 21498 states and 76764 transitions. [2019-12-18 20:31:42,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:31:42,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:31:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:42,889 INFO L225 Difference]: With dead ends: 21498 [2019-12-18 20:31:42,889 INFO L226 Difference]: Without dead ends: 21498 [2019-12-18 20:31:42,889 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-18 20:31:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21498 states. [2019-12-18 20:31:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21498 to 21306. [2019-12-18 20:31:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21306 states. [2019-12-18 20:31:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21306 states to 21306 states and 76108 transitions. [2019-12-18 20:31:43,517 INFO L78 Accepts]: Start accepts. Automaton has 21306 states and 76108 transitions. Word has length 28 [2019-12-18 20:31:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:43,517 INFO L462 AbstractCegarLoop]: Abstraction has 21306 states and 76108 transitions. [2019-12-18 20:31:43,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:31:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 21306 states and 76108 transitions. [2019-12-18 20:31:43,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:31:43,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:43,552 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] [2019-12-18 20:31:43,552 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:43,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:43,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1629751536, now seen corresponding path program 1 times [2019-12-18 20:31:43,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:43,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025995958] [2019-12-18 20:31:43,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:43,636 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-18 20:31:43,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025995958] [2019-12-18 20:31:43,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:43,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:31:43,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259702254] [2019-12-18 20:31:43,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:31:43,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:43,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:31:43,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:31:43,638 INFO L87 Difference]: Start difference. First operand 21306 states and 76108 transitions. Second operand 4 states. [2019-12-18 20:31:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:43,841 INFO L93 Difference]: Finished difference Result 30881 states and 105340 transitions. [2019-12-18 20:31:43,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:31:43,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 20:31:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:43,903 INFO L225 Difference]: With dead ends: 30881 [2019-12-18 20:31:43,903 INFO L226 Difference]: Without dead ends: 21608 [2019-12-18 20:31:43,904 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-18 20:31:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21608 states. [2019-12-18 20:31:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21608 to 21512. [2019-12-18 20:31:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21512 states. [2019-12-18 20:31:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21512 states to 21512 states and 75947 transitions. [2019-12-18 20:31:44,348 INFO L78 Accepts]: Start accepts. Automaton has 21512 states and 75947 transitions. Word has length 42 [2019-12-18 20:31:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:44,349 INFO L462 AbstractCegarLoop]: Abstraction has 21512 states and 75947 transitions. [2019-12-18 20:31:44,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:31:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 21512 states and 75947 transitions. [2019-12-18 20:31:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:31:44,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:44,382 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] [2019-12-18 20:31:44,382 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:44,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:44,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1940145770, now seen corresponding path program 2 times [2019-12-18 20:31:44,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:44,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203760973] [2019-12-18 20:31:44,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:44,475 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-18 20:31:44,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203760973] [2019-12-18 20:31:44,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:44,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:31:44,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731812788] [2019-12-18 20:31:44,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:31:44,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:44,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:31:44,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:31:44,479 INFO L87 Difference]: Start difference. First operand 21512 states and 75947 transitions. Second operand 4 states. [2019-12-18 20:31:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:44,671 INFO L93 Difference]: Finished difference Result 34397 states and 122371 transitions. [2019-12-18 20:31:44,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:31:44,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 20:31:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:44,716 INFO L225 Difference]: With dead ends: 34397 [2019-12-18 20:31:44,717 INFO L226 Difference]: Without dead ends: 18368 [2019-12-18 20:31:44,717 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-18 20:31:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18368 states. [2019-12-18 20:31:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18368 to 18290. [2019-12-18 20:31:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18290 states. [2019-12-18 20:31:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18290 states to 18290 states and 63856 transitions. [2019-12-18 20:31:45,248 INFO L78 Accepts]: Start accepts. Automaton has 18290 states and 63856 transitions. Word has length 42 [2019-12-18 20:31:45,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:45,248 INFO L462 AbstractCegarLoop]: Abstraction has 18290 states and 63856 transitions. [2019-12-18 20:31:45,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:31:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 18290 states and 63856 transitions. [2019-12-18 20:31:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:31:45,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:45,272 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] [2019-12-18 20:31:45,272 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:45,273 INFO L82 PathProgramCache]: Analyzing trace with hash -254857110, now seen corresponding path program 3 times [2019-12-18 20:31:45,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:45,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448215936] [2019-12-18 20:31:45,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:45,377 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-18 20:31:45,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448215936] [2019-12-18 20:31:45,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:45,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:31:45,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927863140] [2019-12-18 20:31:45,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:31:45,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:45,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:31:45,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:31:45,379 INFO L87 Difference]: Start difference. First operand 18290 states and 63856 transitions. Second operand 3 states. [2019-12-18 20:31:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:45,477 INFO L93 Difference]: Finished difference Result 18290 states and 63086 transitions. [2019-12-18 20:31:45,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:31:45,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 20:31:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:45,512 INFO L225 Difference]: With dead ends: 18290 [2019-12-18 20:31:45,513 INFO L226 Difference]: Without dead ends: 18290 [2019-12-18 20:31:45,513 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-18 20:31:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18290 states. [2019-12-18 20:31:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18290 to 18282. [2019-12-18 20:31:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18282 states. [2019-12-18 20:31:45,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18282 states to 18282 states and 63066 transitions. [2019-12-18 20:31:45,834 INFO L78 Accepts]: Start accepts. Automaton has 18282 states and 63066 transitions. Word has length 42 [2019-12-18 20:31:45,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:45,835 INFO L462 AbstractCegarLoop]: Abstraction has 18282 states and 63066 transitions. [2019-12-18 20:31:45,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:31:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 18282 states and 63066 transitions. [2019-12-18 20:31:45,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 20:31:45,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:45,856 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] [2019-12-18 20:31:45,856 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:45,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:45,857 INFO L82 PathProgramCache]: Analyzing trace with hash -135902049, now seen corresponding path program 1 times [2019-12-18 20:31:45,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:45,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839537005] [2019-12-18 20:31:45,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:45,924 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-18 20:31:45,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839537005] [2019-12-18 20:31:45,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:45,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:31:45,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133775069] [2019-12-18 20:31:45,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:31:45,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:45,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:31:45,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:31:45,927 INFO L87 Difference]: Start difference. First operand 18282 states and 63066 transitions. Second operand 6 states. [2019-12-18 20:31:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:46,065 INFO L93 Difference]: Finished difference Result 17048 states and 59973 transitions. [2019-12-18 20:31:46,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:31:46,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 20:31:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:46,099 INFO L225 Difference]: With dead ends: 17048 [2019-12-18 20:31:46,100 INFO L226 Difference]: Without dead ends: 13450 [2019-12-18 20:31:46,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:31:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13450 states. [2019-12-18 20:31:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13450 to 13050. [2019-12-18 20:31:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13050 states. [2019-12-18 20:31:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13050 states to 13050 states and 46802 transitions. [2019-12-18 20:31:46,340 INFO L78 Accepts]: Start accepts. Automaton has 13050 states and 46802 transitions. Word has length 43 [2019-12-18 20:31:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:46,340 INFO L462 AbstractCegarLoop]: Abstraction has 13050 states and 46802 transitions. [2019-12-18 20:31:46,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:31:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 13050 states and 46802 transitions. [2019-12-18 20:31:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:31:46,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:46,362 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] [2019-12-18 20:31:46,362 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:46,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:46,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1260331104, now seen corresponding path program 1 times [2019-12-18 20:31:46,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:46,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614057423] [2019-12-18 20:31:46,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:46,442 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-18 20:31:46,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614057423] [2019-12-18 20:31:46,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:46,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:31:46,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620560009] [2019-12-18 20:31:46,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:31:46,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:46,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:31:46,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:31:46,444 INFO L87 Difference]: Start difference. First operand 13050 states and 46802 transitions. Second operand 4 states. [2019-12-18 20:31:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:46,552 INFO L93 Difference]: Finished difference Result 16902 states and 59193 transitions. [2019-12-18 20:31:46,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:31:46,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-18 20:31:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:46,563 INFO L225 Difference]: With dead ends: 16902 [2019-12-18 20:31:46,564 INFO L226 Difference]: Without dead ends: 4163 [2019-12-18 20:31:46,564 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-18 20:31:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states. [2019-12-18 20:31:46,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 4163. [2019-12-18 20:31:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-12-18 20:31:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 13246 transitions. [2019-12-18 20:31:46,667 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 13246 transitions. Word has length 58 [2019-12-18 20:31:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:46,667 INFO L462 AbstractCegarLoop]: Abstraction has 4163 states and 13246 transitions. [2019-12-18 20:31:46,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:31:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 13246 transitions. [2019-12-18 20:31:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:31:46,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:46,674 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] [2019-12-18 20:31:46,674 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:46,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:46,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1413317050, now seen corresponding path program 2 times [2019-12-18 20:31:46,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:46,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866614393] [2019-12-18 20:31:46,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:46,801 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-18 20:31:46,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866614393] [2019-12-18 20:31:46,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:46,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:31:46,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731676397] [2019-12-18 20:31:46,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:31:46,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:46,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:31:46,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:31:46,804 INFO L87 Difference]: Start difference. First operand 4163 states and 13246 transitions. Second operand 9 states. [2019-12-18 20:31:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:47,924 INFO L93 Difference]: Finished difference Result 8730 states and 27122 transitions. [2019-12-18 20:31:47,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 20:31:47,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-18 20:31:47,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:47,935 INFO L225 Difference]: With dead ends: 8730 [2019-12-18 20:31:47,935 INFO L226 Difference]: Without dead ends: 5906 [2019-12-18 20:31:47,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-12-18 20:31:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5906 states. [2019-12-18 20:31:48,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5906 to 5402. [2019-12-18 20:31:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5402 states. [2019-12-18 20:31:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 16743 transitions. [2019-12-18 20:31:48,025 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 16743 transitions. Word has length 58 [2019-12-18 20:31:48,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:48,026 INFO L462 AbstractCegarLoop]: Abstraction has 5402 states and 16743 transitions. [2019-12-18 20:31:48,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:31:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 16743 transitions. [2019-12-18 20:31:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:31:48,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:48,032 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] [2019-12-18 20:31:48,032 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:48,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:48,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1979655394, now seen corresponding path program 3 times [2019-12-18 20:31:48,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:48,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876377122] [2019-12-18 20:31:48,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:48,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-18 20:31:48,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876377122] [2019-12-18 20:31:48,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:48,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:31:48,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856325871] [2019-12-18 20:31:48,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:31:48,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:48,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:31:48,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:31:48,216 INFO L87 Difference]: Start difference. First operand 5402 states and 16743 transitions. Second operand 10 states. [2019-12-18 20:31:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:50,667 INFO L93 Difference]: Finished difference Result 20213 states and 62125 transitions. [2019-12-18 20:31:50,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 20:31:50,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-18 20:31:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:50,698 INFO L225 Difference]: With dead ends: 20213 [2019-12-18 20:31:50,698 INFO L226 Difference]: Without dead ends: 20033 [2019-12-18 20:31:50,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2019-12-18 20:31:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20033 states. [2019-12-18 20:31:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20033 to 12190. [2019-12-18 20:31:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12190 states. [2019-12-18 20:31:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12190 states to 12190 states and 37683 transitions. [2019-12-18 20:31:50,958 INFO L78 Accepts]: Start accepts. Automaton has 12190 states and 37683 transitions. Word has length 58 [2019-12-18 20:31:50,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:50,958 INFO L462 AbstractCegarLoop]: Abstraction has 12190 states and 37683 transitions. [2019-12-18 20:31:50,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:31:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 12190 states and 37683 transitions. [2019-12-18 20:31:50,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:31:50,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:50,972 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] [2019-12-18 20:31:50,972 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:50,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:50,972 INFO L82 PathProgramCache]: Analyzing trace with hash -56996804, now seen corresponding path program 4 times [2019-12-18 20:31:50,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:50,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388004425] [2019-12-18 20:31:50,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:51,628 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-18 20:31:51,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388004425] [2019-12-18 20:31:51,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:51,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:31:51,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147681545] [2019-12-18 20:31:51,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:31:51,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:51,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:31:51,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:31:51,630 INFO L87 Difference]: Start difference. First operand 12190 states and 37683 transitions. Second operand 16 states. [2019-12-18 20:31:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:54,000 INFO L93 Difference]: Finished difference Result 18267 states and 54839 transitions. [2019-12-18 20:31:54,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 20:31:54,000 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2019-12-18 20:31:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:54,024 INFO L225 Difference]: With dead ends: 18267 [2019-12-18 20:31:54,024 INFO L226 Difference]: Without dead ends: 15886 [2019-12-18 20:31:54,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2019-12-18 20:31:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15886 states. [2019-12-18 20:31:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15886 to 12858. [2019-12-18 20:31:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12858 states. [2019-12-18 20:31:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12858 states to 12858 states and 39319 transitions. [2019-12-18 20:31:54,236 INFO L78 Accepts]: Start accepts. Automaton has 12858 states and 39319 transitions. Word has length 58 [2019-12-18 20:31:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:54,236 INFO L462 AbstractCegarLoop]: Abstraction has 12858 states and 39319 transitions. [2019-12-18 20:31:54,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:31:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 12858 states and 39319 transitions. [2019-12-18 20:31:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:31:54,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:54,251 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] [2019-12-18 20:31:54,251 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash 995281918, now seen corresponding path program 5 times [2019-12-18 20:31:54,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:54,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043423877] [2019-12-18 20:31:54,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:54,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-18 20:31:54,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043423877] [2019-12-18 20:31:54,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:54,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:31:54,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529453184] [2019-12-18 20:31:54,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:31:54,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:54,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:31:54,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:31:54,416 INFO L87 Difference]: Start difference. First operand 12858 states and 39319 transitions. Second operand 10 states. [2019-12-18 20:31:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:55,541 INFO L93 Difference]: Finished difference Result 17099 states and 51706 transitions. [2019-12-18 20:31:55,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 20:31:55,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-18 20:31:55,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:55,563 INFO L225 Difference]: With dead ends: 17099 [2019-12-18 20:31:55,563 INFO L226 Difference]: Without dead ends: 15173 [2019-12-18 20:31:55,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-18 20:31:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15173 states. [2019-12-18 20:31:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15173 to 13182. [2019-12-18 20:31:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13182 states. [2019-12-18 20:31:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13182 states to 13182 states and 40230 transitions. [2019-12-18 20:31:55,773 INFO L78 Accepts]: Start accepts. Automaton has 13182 states and 40230 transitions. Word has length 58 [2019-12-18 20:31:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:55,773 INFO L462 AbstractCegarLoop]: Abstraction has 13182 states and 40230 transitions. [2019-12-18 20:31:55,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:31:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 13182 states and 40230 transitions. [2019-12-18 20:31:55,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:31:55,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:55,789 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] [2019-12-18 20:31:55,789 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:55,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:55,789 INFO L82 PathProgramCache]: Analyzing trace with hash -963260245, now seen corresponding path program 1 times [2019-12-18 20:31:55,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:55,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322686263] [2019-12-18 20:31:55,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:55,835 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-18 20:31:55,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322686263] [2019-12-18 20:31:55,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:55,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:31:55,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866565129] [2019-12-18 20:31:55,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:31:55,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:55,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:31:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:31:55,838 INFO L87 Difference]: Start difference. First operand 13182 states and 40230 transitions. Second operand 3 states. [2019-12-18 20:31:55,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:55,939 INFO L93 Difference]: Finished difference Result 15488 states and 47007 transitions. [2019-12-18 20:31:55,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:31:55,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 20:31:55,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:55,969 INFO L225 Difference]: With dead ends: 15488 [2019-12-18 20:31:55,969 INFO L226 Difference]: Without dead ends: 15488 [2019-12-18 20:31:55,970 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-18 20:31:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15488 states. [2019-12-18 20:31:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15488 to 11532. [2019-12-18 20:31:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11532 states. [2019-12-18 20:31:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11532 states to 11532 states and 34755 transitions. [2019-12-18 20:31:56,328 INFO L78 Accepts]: Start accepts. Automaton has 11532 states and 34755 transitions. Word has length 58 [2019-12-18 20:31:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:56,329 INFO L462 AbstractCegarLoop]: Abstraction has 11532 states and 34755 transitions. [2019-12-18 20:31:56,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:31:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 11532 states and 34755 transitions. [2019-12-18 20:31:56,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:31:56,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:56,351 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] [2019-12-18 20:31:56,351 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:56,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:56,352 INFO L82 PathProgramCache]: Analyzing trace with hash -339189948, now seen corresponding path program 6 times [2019-12-18 20:31:56,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:56,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134834697] [2019-12-18 20:31:56,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:56,461 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-18 20:31:56,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134834697] [2019-12-18 20:31:56,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:56,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:31:56,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217343370] [2019-12-18 20:31:56,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:31:56,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:56,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:31:56,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:31:56,537 INFO L87 Difference]: Start difference. First operand 11532 states and 34755 transitions. Second operand 3 states. [2019-12-18 20:31:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:56,588 INFO L93 Difference]: Finished difference Result 11530 states and 34750 transitions. [2019-12-18 20:31:56,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:31:56,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 20:31:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:56,609 INFO L225 Difference]: With dead ends: 11530 [2019-12-18 20:31:56,610 INFO L226 Difference]: Without dead ends: 11530 [2019-12-18 20:31:56,612 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-18 20:31:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11530 states. [2019-12-18 20:31:56,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11530 to 10981. [2019-12-18 20:31:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10981 states. [2019-12-18 20:31:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10981 states to 10981 states and 33256 transitions. [2019-12-18 20:31:56,843 INFO L78 Accepts]: Start accepts. Automaton has 10981 states and 33256 transitions. Word has length 58 [2019-12-18 20:31:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:56,844 INFO L462 AbstractCegarLoop]: Abstraction has 10981 states and 33256 transitions. [2019-12-18 20:31:56,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:31:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 10981 states and 33256 transitions. [2019-12-18 20:31:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:31:56,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:56,856 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] [2019-12-18 20:31:56,856 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:56,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:56,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1836022623, now seen corresponding path program 1 times [2019-12-18 20:31:56,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:56,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438468237] [2019-12-18 20:31:56,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:57,096 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-18 20:31:57,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438468237] [2019-12-18 20:31:57,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:57,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:31:57,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664720957] [2019-12-18 20:31:57,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:31:57,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:57,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:31:57,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:31:57,098 INFO L87 Difference]: Start difference. First operand 10981 states and 33256 transitions. Second operand 10 states. [2019-12-18 20:31:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:57,815 INFO L93 Difference]: Finished difference Result 15364 states and 46753 transitions. [2019-12-18 20:31:57,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 20:31:57,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 20:31:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:57,836 INFO L225 Difference]: With dead ends: 15364 [2019-12-18 20:31:57,836 INFO L226 Difference]: Without dead ends: 14670 [2019-12-18 20:31:57,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-12-18 20:31:57,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14670 states. [2019-12-18 20:31:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14670 to 13001. [2019-12-18 20:31:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13001 states. [2019-12-18 20:31:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13001 states to 13001 states and 39701 transitions. [2019-12-18 20:31:58,052 INFO L78 Accepts]: Start accepts. Automaton has 13001 states and 39701 transitions. Word has length 59 [2019-12-18 20:31:58,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:58,054 INFO L462 AbstractCegarLoop]: Abstraction has 13001 states and 39701 transitions. [2019-12-18 20:31:58,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:31:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 13001 states and 39701 transitions. [2019-12-18 20:31:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:31:58,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:58,070 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] [2019-12-18 20:31:58,070 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:58,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1252614195, now seen corresponding path program 2 times [2019-12-18 20:31:58,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:58,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918142486] [2019-12-18 20:31:58,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:58,285 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-18 20:31:58,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918142486] [2019-12-18 20:31:58,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:58,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:31:58,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957323001] [2019-12-18 20:31:58,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:31:58,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:58,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:31:58,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:31:58,287 INFO L87 Difference]: Start difference. First operand 13001 states and 39701 transitions. Second operand 11 states. [2019-12-18 20:31:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:31:59,538 INFO L93 Difference]: Finished difference Result 15825 states and 47677 transitions. [2019-12-18 20:31:59,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:31:59,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 20:31:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:31:59,561 INFO L225 Difference]: With dead ends: 15825 [2019-12-18 20:31:59,561 INFO L226 Difference]: Without dead ends: 15047 [2019-12-18 20:31:59,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:31:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15047 states. [2019-12-18 20:31:59,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15047 to 12725. [2019-12-18 20:31:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12725 states. [2019-12-18 20:31:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12725 states to 12725 states and 38938 transitions. [2019-12-18 20:31:59,776 INFO L78 Accepts]: Start accepts. Automaton has 12725 states and 38938 transitions. Word has length 59 [2019-12-18 20:31:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:31:59,776 INFO L462 AbstractCegarLoop]: Abstraction has 12725 states and 38938 transitions. [2019-12-18 20:31:59,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:31:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 12725 states and 38938 transitions. [2019-12-18 20:31:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:31:59,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:31:59,790 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] [2019-12-18 20:31:59,790 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:31:59,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:31:59,791 INFO L82 PathProgramCache]: Analyzing trace with hash 912465139, now seen corresponding path program 3 times [2019-12-18 20:31:59,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:31:59,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861973836] [2019-12-18 20:31:59,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:31:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:31:59,932 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-18 20:31:59,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861973836] [2019-12-18 20:31:59,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:31:59,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:31:59,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766679688] [2019-12-18 20:31:59,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:31:59,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:31:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:31:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:31:59,934 INFO L87 Difference]: Start difference. First operand 12725 states and 38938 transitions. Second operand 11 states. [2019-12-18 20:32:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:32:01,105 INFO L93 Difference]: Finished difference Result 16494 states and 49989 transitions. [2019-12-18 20:32:01,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 20:32:01,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 20:32:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:32:01,127 INFO L225 Difference]: With dead ends: 16494 [2019-12-18 20:32:01,127 INFO L226 Difference]: Without dead ends: 14552 [2019-12-18 20:32:01,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 20:32:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14552 states. [2019-12-18 20:32:01,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14552 to 12932. [2019-12-18 20:32:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12932 states. [2019-12-18 20:32:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12932 states to 12932 states and 39458 transitions. [2019-12-18 20:32:01,349 INFO L78 Accepts]: Start accepts. Automaton has 12932 states and 39458 transitions. Word has length 59 [2019-12-18 20:32:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:32:01,349 INFO L462 AbstractCegarLoop]: Abstraction has 12932 states and 39458 transitions. [2019-12-18 20:32:01,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:32:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 12932 states and 39458 transitions. [2019-12-18 20:32:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:32:01,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:32:01,364 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] [2019-12-18 20:32:01,364 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:32:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:32:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash -410409827, now seen corresponding path program 4 times [2019-12-18 20:32:01,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:32:01,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644816803] [2019-12-18 20:32:01,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:32:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:32:01,644 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-18 20:32:01,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644816803] [2019-12-18 20:32:01,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:32:01,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:32:01,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594573706] [2019-12-18 20:32:01,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:32:01,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:32:01,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:32:01,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:32:01,648 INFO L87 Difference]: Start difference. First operand 12932 states and 39458 transitions. Second operand 11 states. [2019-12-18 20:32:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:32:02,533 INFO L93 Difference]: Finished difference Result 17750 states and 53704 transitions. [2019-12-18 20:32:02,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 20:32:02,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 20:32:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:32:02,551 INFO L225 Difference]: With dead ends: 17750 [2019-12-18 20:32:02,551 INFO L226 Difference]: Without dead ends: 11153 [2019-12-18 20:32:02,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-18 20:32:02,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11153 states. [2019-12-18 20:32:02,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11153 to 10067. [2019-12-18 20:32:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10067 states. [2019-12-18 20:32:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10067 states to 10067 states and 30633 transitions. [2019-12-18 20:32:02,714 INFO L78 Accepts]: Start accepts. Automaton has 10067 states and 30633 transitions. Word has length 59 [2019-12-18 20:32:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:32:02,714 INFO L462 AbstractCegarLoop]: Abstraction has 10067 states and 30633 transitions. [2019-12-18 20:32:02,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:32:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 10067 states and 30633 transitions. [2019-12-18 20:32:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:32:02,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:32:02,725 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] [2019-12-18 20:32:02,725 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:32:02,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:32:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1628182047, now seen corresponding path program 5 times [2019-12-18 20:32:02,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:32:02,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443587517] [2019-12-18 20:32:02,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:32:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:32:03,224 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-18 20:32:03,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443587517] [2019-12-18 20:32:03,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:32:03,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 20:32:03,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629011258] [2019-12-18 20:32:03,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 20:32:03,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:32:03,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 20:32:03,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:32:03,227 INFO L87 Difference]: Start difference. First operand 10067 states and 30633 transitions. Second operand 17 states. [2019-12-18 20:32:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:32:05,987 INFO L93 Difference]: Finished difference Result 14196 states and 41834 transitions. [2019-12-18 20:32:05,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 20:32:05,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-18 20:32:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:32:06,012 INFO L225 Difference]: With dead ends: 14196 [2019-12-18 20:32:06,013 INFO L226 Difference]: Without dead ends: 13636 [2019-12-18 20:32:06,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 20:32:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13636 states. [2019-12-18 20:32:06,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13636 to 10472. [2019-12-18 20:32:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10472 states. [2019-12-18 20:32:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10472 states to 10472 states and 31866 transitions. [2019-12-18 20:32:06,203 INFO L78 Accepts]: Start accepts. Automaton has 10472 states and 31866 transitions. Word has length 59 [2019-12-18 20:32:06,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:32:06,203 INFO L462 AbstractCegarLoop]: Abstraction has 10472 states and 31866 transitions. [2019-12-18 20:32:06,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 20:32:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 10472 states and 31866 transitions. [2019-12-18 20:32:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:32:06,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:32:06,218 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] [2019-12-18 20:32:06,218 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:32:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:32:06,219 INFO L82 PathProgramCache]: Analyzing trace with hash 317629459, now seen corresponding path program 6 times [2019-12-18 20:32:06,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:32:06,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901651407] [2019-12-18 20:32:06,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:32:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:32:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:32:06,327 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:32:06,328 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:32:06,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_79| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~y$r_buff0_thd1~0_7 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p3_EAX~0_15) (= 0 v_~y$w_buff1~0_26) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~main$tmp_guard0~0_9 0) (= v_~y$r_buff0_thd3~0_24 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_66 0) (= |v_#valid_77| (store .cse0 |v_ULTIMATE.start_main_~#t453~0.base_22| 1)) (= 0 v_~y$flush_delayed~0_14) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t453~0.base_22| 4)) (= 0 |v_ULTIMATE.start_main_~#t453~0.offset_17|) (= 0 v_~__unbuffered_cnt~0_26) (= v_~y$r_buff1_thd1~0_8 0) (= v_~y$r_buff0_thd0~0_19 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p3_EBX~0_15) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$w_buff0~0_27) (= v_~y$w_buff0_used~0_105 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_22| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_22|) |v_ULTIMATE.start_main_~#t453~0.offset_17| 0)) |v_#memory_int_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t453~0.base_22|)) (= 0 v_~z~0_9) (= 0 v_~y$r_buff1_thd3~0_18) (= v_~a~0_12 0) (= v_~y$mem_tmp~0_10 0) (= v_~y$r_buff0_thd4~0_19 0) (= v_~x~0_12 0) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$r_buff1_thd2~0_42) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t453~0.base_22|) (= 0 v_~y$r_buff1_thd4~0_18))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_22|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_16|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_12, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_66, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_21, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_20|, ~y~0=v_~y~0_25, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_17|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ULTIMATE.start_main_~#t453~0.base=|v_ULTIMATE.start_main_~#t453~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, ULTIMATE.start_main_~#t453~0.offset=|v_ULTIMATE.start_main_~#t453~0.offset_17|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_19, ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t455~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t456~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t456~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t455~0.base, ~y~0, ULTIMATE.start_main_~#t454~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t453~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t453~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t454~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:32:06,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L845-1-->L847: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t454~0.base_11| 4) |v_#length_23|) (= |v_ULTIMATE.start_main_~#t454~0.offset_10| 0) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t454~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11|) |v_ULTIMATE.start_main_~#t454~0.offset_10| 1)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t454~0.base_11|)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t454~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t454~0.offset] because there is no mapped edge [2019-12-18 20:32:06,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L847-1-->L849: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t455~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t455~0.offset_9|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t455~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10|) |v_ULTIMATE.start_main_~#t455~0.offset_9| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t455~0.base_10| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10| 1) |v_#valid_39|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_10|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t455~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t455~0.offset] because there is no mapped edge [2019-12-18 20:32:06,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L849-1-->L851: Formula: (and (= |v_ULTIMATE.start_main_~#t456~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t456~0.base_13| 4) |v_#length_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13| 1) |v_#valid_41|) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13|) |v_ULTIMATE.start_main_~#t456~0.offset_11| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t456~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t456~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t456~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t456~0.offset] because there is no mapped edge [2019-12-18 20:32:06,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] P2ENTRY-->L4-3: Formula: (and (= ~y$w_buff1_used~0_Out-1333043369 ~y$w_buff0_used~0_In-1333043369) (= 1 ~y$w_buff0~0_Out-1333043369) (= P2Thread1of1ForFork3_~arg.offset_Out-1333043369 |P2Thread1of1ForFork3_#in~arg.offset_In-1333043369|) (= 1 |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-1333043369|) (= ~y$w_buff0_used~0_Out-1333043369 1) (= (mod ~y$w_buff1_used~0_Out-1333043369 256) 0) (= P2Thread1of1ForFork3_~arg.base_Out-1333043369 |P2Thread1of1ForFork3_#in~arg.base_In-1333043369|) (= P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out-1333043369 |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-1333043369|) (= ~y$w_buff1~0_Out-1333043369 ~y$w_buff0~0_In-1333043369)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1333043369, ~y$w_buff0~0=~y$w_buff0~0_In-1333043369, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In-1333043369|, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In-1333043369|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1333043369, ~y$w_buff1~0=~y$w_buff1~0_Out-1333043369, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-1333043369|, ~y$w_buff0~0=~y$w_buff0~0_Out-1333043369, P2Thread1of1ForFork3_~arg.base=P2Thread1of1ForFork3_~arg.base_Out-1333043369, P2Thread1of1ForFork3___VERIFIER_assert_~expression=P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out-1333043369, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In-1333043369|, P2Thread1of1ForFork3_~arg.offset=P2Thread1of1ForFork3_~arg.offset_Out-1333043369, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In-1333043369|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1333043369} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3___VERIFIER_assert_~expression, P2Thread1of1ForFork3_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:32:06,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7} OutVars{~a~0=v_~a~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:32:06,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L822-2-->L822-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out-1202617438| |P3Thread1of1ForFork0_#t~ite32_Out-1202617438|)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-1202617438 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1202617438 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-1202617438 |P3Thread1of1ForFork0_#t~ite32_Out-1202617438|)) (and .cse0 (or .cse2 .cse1) (= |P3Thread1of1ForFork0_#t~ite32_Out-1202617438| ~y~0_In-1202617438)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1202617438, ~y$w_buff1~0=~y$w_buff1~0_In-1202617438, ~y~0=~y~0_In-1202617438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1202617438} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1202617438, ~y$w_buff1~0=~y$w_buff1~0_In-1202617438, ~y~0=~y~0_In-1202617438, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-1202617438|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1202617438|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1202617438} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 20:32:06,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-285569492 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-285569492 256)))) (or (and (= ~y$w_buff0_used~0_In-285569492 |P2Thread1of1ForFork3_#t~ite28_Out-285569492|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-285569492|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-285569492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-285569492} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-285569492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-285569492, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-285569492|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 20:32:06,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-268443115 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In-268443115 256) 0))) (or (and (= ~y$w_buff0_used~0_In-268443115 |P3Thread1of1ForFork0_#t~ite34_Out-268443115|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out-268443115|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-268443115, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-268443115} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-268443115, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-268443115, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-268443115|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 20:32:06,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In148626364 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In148626364 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In148626364 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In148626364 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite29_Out148626364| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite29_Out148626364| ~y$w_buff1_used~0_In148626364)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In148626364, ~y$w_buff0_used~0=~y$w_buff0_used~0_In148626364, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In148626364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In148626364} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In148626364, ~y$w_buff0_used~0=~y$w_buff0_used~0_In148626364, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In148626364, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out148626364|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In148626364} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 20:32:06,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In901564695 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out901564695| ~y$w_buff0~0_In901564695) (= |P1Thread1of1ForFork2_#t~ite8_In901564695| |P1Thread1of1ForFork2_#t~ite8_Out901564695|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In901564695 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In901564695 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In901564695 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In901564695 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite9_Out901564695| |P1Thread1of1ForFork2_#t~ite8_Out901564695|) (= |P1Thread1of1ForFork2_#t~ite8_Out901564695| ~y$w_buff0~0_In901564695)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In901564695, ~y$w_buff0_used~0=~y$w_buff0_used~0_In901564695, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In901564695|, ~y$w_buff0~0=~y$w_buff0~0_In901564695, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In901564695, ~weak$$choice2~0=~weak$$choice2~0_In901564695, ~y$w_buff1_used~0=~y$w_buff1_used~0_In901564695} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In901564695, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out901564695|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In901564695, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out901564695|, ~y$w_buff0~0=~y$w_buff0~0_In901564695, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In901564695, ~weak$$choice2~0=~weak$$choice2~0_In901564695, ~y$w_buff1_used~0=~y$w_buff1_used~0_In901564695} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 20:32:06,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-341994336 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-341994336| |P1Thread1of1ForFork2_#t~ite12_Out-341994336|) (= |P1Thread1of1ForFork2_#t~ite11_Out-341994336| ~y$w_buff1~0_In-341994336) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-341994336 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-341994336 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-341994336 256))) (= 0 (mod ~y$w_buff0_used~0_In-341994336 256))))) (and (= |P1Thread1of1ForFork2_#t~ite11_In-341994336| |P1Thread1of1ForFork2_#t~ite11_Out-341994336|) (= |P1Thread1of1ForFork2_#t~ite12_Out-341994336| ~y$w_buff1~0_In-341994336) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-341994336, ~y$w_buff1~0=~y$w_buff1~0_In-341994336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-341994336, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-341994336, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-341994336|, ~weak$$choice2~0=~weak$$choice2~0_In-341994336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-341994336} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-341994336, ~y$w_buff1~0=~y$w_buff1~0_In-341994336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-341994336, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-341994336, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-341994336|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-341994336|, ~weak$$choice2~0=~weak$$choice2~0_In-341994336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-341994336} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:32:06,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L802-->L803: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1972823963 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1972823963 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-1972823963)) (and (= ~y$r_buff0_thd3~0_In-1972823963 ~y$r_buff0_thd3~0_Out-1972823963) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1972823963, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1972823963} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1972823963|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1972823963, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1972823963} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 20:32:06,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In508667447 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In508667447 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In508667447 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In508667447 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite31_Out508667447| ~y$r_buff1_thd3~0_In508667447)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out508667447| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In508667447, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508667447, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In508667447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508667447} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In508667447, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508667447, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In508667447, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out508667447|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508667447} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 20:32:06,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_13) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 20:32:06,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-970561154 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-970561154 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-970561154 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-970561154 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out-970561154| ~y$w_buff1_used~0_In-970561154) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork0_#t~ite35_Out-970561154| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-970561154, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-970561154, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-970561154, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-970561154} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-970561154, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-970561154, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-970561154, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-970561154|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-970561154} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 20:32:06,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-2033946468 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2033946468 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-2033946468| 0)) (and (= |P3Thread1of1ForFork0_#t~ite36_Out-2033946468| ~y$r_buff0_thd4~0_In-2033946468) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2033946468, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2033946468} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2033946468, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2033946468, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-2033946468|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 20:32:06,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-961596184 256))) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-961596184 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-961596184 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In-961596184 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-961596184|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite37_Out-961596184| ~y$r_buff1_thd4~0_In-961596184)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-961596184, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-961596184, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-961596184, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-961596184} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-961596184, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-961596184, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-961596184, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-961596184|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-961596184} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 20:32:06,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:32:06,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In276894558 256) 0))) (or (and (= ~y$w_buff0_used~0_In276894558 |P1Thread1of1ForFork2_#t~ite14_Out276894558|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In276894558 256)))) (or (= (mod ~y$w_buff0_used~0_In276894558 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In276894558 256)) .cse0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In276894558 256))))) (= |P1Thread1of1ForFork2_#t~ite15_Out276894558| |P1Thread1of1ForFork2_#t~ite14_Out276894558|) .cse1) (and (= ~y$w_buff0_used~0_In276894558 |P1Thread1of1ForFork2_#t~ite15_Out276894558|) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite14_In276894558| |P1Thread1of1ForFork2_#t~ite14_Out276894558|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In276894558, ~y$w_buff0_used~0=~y$w_buff0_used~0_In276894558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In276894558, ~weak$$choice2~0=~weak$$choice2~0_In276894558, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In276894558|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In276894558} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In276894558, ~y$w_buff0_used~0=~y$w_buff0_used~0_In276894558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In276894558, ~weak$$choice2~0=~weak$$choice2~0_In276894558, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out276894558|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out276894558|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In276894558} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 20:32:06,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff0_thd2~0_52)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 20:32:06,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In531531072 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite24_Out531531072| ~y$r_buff1_thd2~0_In531531072) (= |P1Thread1of1ForFork2_#t~ite23_In531531072| |P1Thread1of1ForFork2_#t~ite23_Out531531072|) (not .cse0)) (and (= |P1Thread1of1ForFork2_#t~ite24_Out531531072| |P1Thread1of1ForFork2_#t~ite23_Out531531072|) .cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out531531072| ~y$r_buff1_thd2~0_In531531072) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In531531072 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In531531072 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In531531072 256)) (and (= (mod ~y$w_buff1_used~0_In531531072 256) 0) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In531531072, ~y$w_buff0_used~0=~y$w_buff0_used~0_In531531072, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In531531072, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In531531072|, ~weak$$choice2~0=~weak$$choice2~0_In531531072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In531531072} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In531531072, ~y$w_buff0_used~0=~y$w_buff0_used~0_In531531072, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In531531072, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out531531072|, ~weak$$choice2~0=~weak$$choice2~0_In531531072, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out531531072|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In531531072} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 20:32:06,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L770-->L778: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~y~0_16 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~y~0=v_~y~0_16, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:32:06,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L851-1-->L857: Formula: (and (= 4 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:32:06,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L857-2-->L857-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-53083739 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-53083739 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-53083739| ~y$w_buff1~0_In-53083739) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-53083739| ~y~0_In-53083739)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-53083739, ~y~0=~y~0_In-53083739, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-53083739, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-53083739} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-53083739, ~y~0=~y~0_In-53083739, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-53083739|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-53083739, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-53083739} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:32:06,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L857-4-->L858: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite42_8|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_7|, ~y~0=v_~y~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:32:06,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2063893305 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2063893305 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out2063893305|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out2063893305| ~y$w_buff0_used~0_In2063893305)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2063893305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2063893305} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2063893305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2063893305, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2063893305|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:32:06,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L859-->L859-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In670327300 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In670327300 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In670327300 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In670327300 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out670327300| ~y$w_buff1_used~0_In670327300)) (and (= |ULTIMATE.start_main_#t~ite45_Out670327300| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In670327300, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In670327300, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In670327300, ~y$w_buff1_used~0=~y$w_buff1_used~0_In670327300} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In670327300, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In670327300, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In670327300, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out670327300|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In670327300} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:32:06,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L860-->L860-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In899074817 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In899074817 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out899074817| ~y$r_buff0_thd0~0_In899074817) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite46_Out899074817| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In899074817, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In899074817} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In899074817, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In899074817, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out899074817|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:32:06,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L861-->L861-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1394740795 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1394740795 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1394740795 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1394740795 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite47_Out-1394740795|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-1394740795 |ULTIMATE.start_main_#t~ite47_Out-1394740795|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1394740795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1394740795, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1394740795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1394740795} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1394740795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1394740795, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1394740795|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1394740795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1394740795} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:32:06,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p2_EAX~0_11) (= |v_ULTIMATE.start_main_#t~ite47_17| v_~y$r_buff1_thd0~0_16) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_11) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~__unbuffered_p0_EAX~0_12) (= 1 v_~__unbuffered_p3_EAX~0_11)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:32:06,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:32:06 BasicIcfg [2019-12-18 20:32:06,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:32:06,443 INFO L168 Benchmark]: Toolchain (without parser) took 149692.26 ms. Allocated memory was 146.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 20:32:06,443 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 20:32:06,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.98 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 100.7 MB in the beginning and 156.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:32:06,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.57 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 152.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:32:06,445 INFO L168 Benchmark]: Boogie Preprocessor took 63.19 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 151.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:32:06,445 INFO L168 Benchmark]: RCFGBuilder took 809.68 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 101.5 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:32:06,446 INFO L168 Benchmark]: TraceAbstraction took 148019.39 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.8 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 20:32:06,449 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.43 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.98 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 100.7 MB in the beginning and 156.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.57 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 152.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.19 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 151.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 809.68 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 101.5 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 148019.39 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.8 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 182 ProgramPointsBefore, 89 ProgramPointsAfterwards, 210 TransitionsBefore, 94 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 28 ChoiceCompositions, 7202 VarBasedMoverChecksPositive, 204 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 74863 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t455, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t456, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 [L816] 4 __unbuffered_p3_EAX = z [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L755] 2 x = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 147.7s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 36.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3939 SDtfs, 6140 SDslu, 13550 SDs, 0 SdLazy, 11380 SolverSat, 338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 30 SyntacticMatches, 14 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227200occurred 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: 62.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 62004 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 968 ConstructedInterpolants, 0 QuantifiedInterpolants, 226418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...