/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 02:35:10,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 02:35:10,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 02:35:10,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 02:35:10,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 02:35:10,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 02:35:10,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 02:35:10,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 02:35:10,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 02:35:10,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 02:35:10,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 02:35:10,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 02:35:10,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 02:35:10,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 02:35:10,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 02:35:10,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 02:35:10,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 02:35:10,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 02:35:10,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 02:35:10,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 02:35:10,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 02:35:10,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 02:35:10,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 02:35:10,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 02:35:10,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 02:35:10,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 02:35:10,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 02:35:10,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 02:35:10,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 02:35:10,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 02:35:10,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 02:35:10,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 02:35:10,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 02:35:10,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 02:35:10,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 02:35:10,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 02:35:10,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 02:35:10,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 02:35:10,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 02:35:10,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 02:35:10,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 02:35:10,423 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-NoLbe.epf [2019-12-19 02:35:10,457 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 02:35:10,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 02:35:10,461 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 02:35:10,461 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 02:35:10,461 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 02:35:10,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 02:35:10,461 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 02:35:10,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 02:35:10,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 02:35:10,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 02:35:10,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 02:35:10,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 02:35:10,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 02:35:10,468 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 02:35:10,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 02:35:10,468 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 02:35:10,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 02:35:10,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 02:35:10,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 02:35:10,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 02:35:10,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 02:35:10,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 02:35:10,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 02:35:10,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 02:35:10,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 02:35:10,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 02:35:10,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 02:35:10,471 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 02:35:10,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 02:35:10,471 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 02:35:10,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 02:35:10,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 02:35:10,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 02:35:10,762 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 02:35:10,762 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 02:35:10,763 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i [2019-12-19 02:35:10,826 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e0d6653/b998ba8edab643d29e06b31a6439303b/FLAG9d4f8e325 [2019-12-19 02:35:11,361 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 02:35:11,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i [2019-12-19 02:35:11,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e0d6653/b998ba8edab643d29e06b31a6439303b/FLAG9d4f8e325 [2019-12-19 02:35:11,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e0d6653/b998ba8edab643d29e06b31a6439303b [2019-12-19 02:35:11,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 02:35:11,681 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 02:35:11,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 02:35:11,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 02:35:11,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 02:35:11,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:35:11" (1/1) ... [2019-12-19 02:35:11,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:11, skipping insertion in model container [2019-12-19 02:35:11,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:35:11" (1/1) ... [2019-12-19 02:35:11,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 02:35:11,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 02:35:12,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:35:12,363 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 02:35:12,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:35:12,531 INFO L208 MainTranslator]: Completed translation [2019-12-19 02:35:12,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:12 WrapperNode [2019-12-19 02:35:12,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 02:35:12,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 02:35:12,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 02:35:12,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 02:35:12,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:12" (1/1) ... [2019-12-19 02:35:12,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:12" (1/1) ... [2019-12-19 02:35:12,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 02:35:12,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 02:35:12,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 02:35:12,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 02:35:12,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:12" (1/1) ... [2019-12-19 02:35:12,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:12" (1/1) ... [2019-12-19 02:35:12,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:12" (1/1) ... [2019-12-19 02:35:12,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:12" (1/1) ... [2019-12-19 02:35:12,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:12" (1/1) ... [2019-12-19 02:35:12,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:12" (1/1) ... [2019-12-19 02:35:12,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:12" (1/1) ... [2019-12-19 02:35:12,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 02:35:12,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 02:35:12,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 02:35:12,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 02:35:12,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:12" (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-19 02:35:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 02:35:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 02:35:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 02:35:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 02:35:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 02:35:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 02:35:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 02:35:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 02:35:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 02:35:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 02:35:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 02:35:12,725 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 02:35:13,519 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 02:35:13,520 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 02:35:13,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:35:13 BoogieIcfgContainer [2019-12-19 02:35:13,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 02:35:13,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 02:35:13,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 02:35:13,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 02:35:13,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:35:11" (1/3) ... [2019-12-19 02:35:13,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2693802e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:35:13, skipping insertion in model container [2019-12-19 02:35:13,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:12" (2/3) ... [2019-12-19 02:35:13,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2693802e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:35:13, skipping insertion in model container [2019-12-19 02:35:13,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:35:13" (3/3) ... [2019-12-19 02:35:13,531 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_pso.oepc.i [2019-12-19 02:35:13,542 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 02:35:13,542 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 02:35:13,551 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 02:35:13,552 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 02:35:13,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,611 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,625 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,626 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,676 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,676 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,677 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,700 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:13,721 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 02:35:13,743 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 02:35:13,743 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 02:35:13,743 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 02:35:13,743 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 02:35:13,743 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 02:35:13,743 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 02:35:13,744 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 02:35:13,744 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 02:35:13,758 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-19 02:35:16,249 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32592 states. [2019-12-19 02:35:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 32592 states. [2019-12-19 02:35:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-19 02:35:16,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:16,352 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] [2019-12-19 02:35:16,353 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash -62745772, now seen corresponding path program 1 times [2019-12-19 02:35:16,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:16,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401911794] [2019-12-19 02:35:16,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:16,702 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-19 02:35:16,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401911794] [2019-12-19 02:35:16,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:16,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:35:16,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621279457] [2019-12-19 02:35:16,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:35:16,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:16,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:35:16,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:16,732 INFO L87 Difference]: Start difference. First operand 32592 states. Second operand 4 states. [2019-12-19 02:35:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:17,413 INFO L93 Difference]: Finished difference Result 33592 states and 129569 transitions. [2019-12-19 02:35:17,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:35:17,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-19 02:35:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:18,674 INFO L225 Difference]: With dead ends: 33592 [2019-12-19 02:35:18,674 INFO L226 Difference]: Without dead ends: 25704 [2019-12-19 02:35:18,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25704 states. [2019-12-19 02:35:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25704 to 25704. [2019-12-19 02:35:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25704 states. [2019-12-19 02:35:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25704 states to 25704 states and 99585 transitions. [2019-12-19 02:35:20,116 INFO L78 Accepts]: Start accepts. Automaton has 25704 states and 99585 transitions. Word has length 35 [2019-12-19 02:35:20,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:20,117 INFO L462 AbstractCegarLoop]: Abstraction has 25704 states and 99585 transitions. [2019-12-19 02:35:20,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:35:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 25704 states and 99585 transitions. [2019-12-19 02:35:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 02:35:20,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:20,132 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] [2019-12-19 02:35:20,132 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:20,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:20,133 INFO L82 PathProgramCache]: Analyzing trace with hash 39166116, now seen corresponding path program 1 times [2019-12-19 02:35:20,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:20,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827868360] [2019-12-19 02:35:20,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:20,311 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-19 02:35:20,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827868360] [2019-12-19 02:35:20,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:20,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:35:20,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266043836] [2019-12-19 02:35:20,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:35:20,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:20,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:35:20,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:20,315 INFO L87 Difference]: Start difference. First operand 25704 states and 99585 transitions. Second operand 5 states. [2019-12-19 02:35:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:21,379 INFO L93 Difference]: Finished difference Result 41082 states and 150432 transitions. [2019-12-19 02:35:21,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:35:21,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 02:35:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:21,537 INFO L225 Difference]: With dead ends: 41082 [2019-12-19 02:35:21,537 INFO L226 Difference]: Without dead ends: 40546 [2019-12-19 02:35:21,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:35:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-12-19 02:35:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 38926. [2019-12-19 02:35:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38926 states. [2019-12-19 02:35:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38926 states to 38926 states and 143582 transitions. [2019-12-19 02:35:24,410 INFO L78 Accepts]: Start accepts. Automaton has 38926 states and 143582 transitions. Word has length 47 [2019-12-19 02:35:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:24,412 INFO L462 AbstractCegarLoop]: Abstraction has 38926 states and 143582 transitions. [2019-12-19 02:35:24,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:35:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 38926 states and 143582 transitions. [2019-12-19 02:35:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 02:35:24,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:24,430 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] [2019-12-19 02:35:24,430 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:24,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:24,432 INFO L82 PathProgramCache]: Analyzing trace with hash -578380571, now seen corresponding path program 1 times [2019-12-19 02:35:24,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:24,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972171143] [2019-12-19 02:35:24,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:24,593 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-19 02:35:24,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972171143] [2019-12-19 02:35:24,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:24,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:35:24,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531480863] [2019-12-19 02:35:24,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:35:24,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:24,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:35:24,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:24,595 INFO L87 Difference]: Start difference. First operand 38926 states and 143582 transitions. Second operand 5 states. [2019-12-19 02:35:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:25,176 INFO L93 Difference]: Finished difference Result 49779 states and 180634 transitions. [2019-12-19 02:35:25,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:35:25,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 02:35:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:27,123 INFO L225 Difference]: With dead ends: 49779 [2019-12-19 02:35:27,123 INFO L226 Difference]: Without dead ends: 49275 [2019-12-19 02:35:27,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:35:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49275 states. [2019-12-19 02:35:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49275 to 42678. [2019-12-19 02:35:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42678 states. [2019-12-19 02:35:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42678 states to 42678 states and 156593 transitions. [2019-12-19 02:35:28,316 INFO L78 Accepts]: Start accepts. Automaton has 42678 states and 156593 transitions. Word has length 48 [2019-12-19 02:35:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:28,316 INFO L462 AbstractCegarLoop]: Abstraction has 42678 states and 156593 transitions. [2019-12-19 02:35:28,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:35:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 42678 states and 156593 transitions. [2019-12-19 02:35:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 02:35:28,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:28,325 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] [2019-12-19 02:35:28,325 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:28,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:28,325 INFO L82 PathProgramCache]: Analyzing trace with hash -801717045, now seen corresponding path program 1 times [2019-12-19 02:35:28,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:28,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138350802] [2019-12-19 02:35:28,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:28,386 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-19 02:35:28,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138350802] [2019-12-19 02:35:28,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:28,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:35:28,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403630598] [2019-12-19 02:35:28,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:35:28,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:28,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:35:28,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:35:28,389 INFO L87 Difference]: Start difference. First operand 42678 states and 156593 transitions. Second operand 3 states. [2019-12-19 02:35:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:28,676 INFO L93 Difference]: Finished difference Result 61088 states and 221431 transitions. [2019-12-19 02:35:28,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:35:28,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-19 02:35:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:28,874 INFO L225 Difference]: With dead ends: 61088 [2019-12-19 02:35:28,875 INFO L226 Difference]: Without dead ends: 61088 [2019-12-19 02:35:28,875 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-19 02:35:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61088 states. [2019-12-19 02:35:32,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61088 to 48017. [2019-12-19 02:35:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48017 states. [2019-12-19 02:35:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48017 states to 48017 states and 174180 transitions. [2019-12-19 02:35:32,517 INFO L78 Accepts]: Start accepts. Automaton has 48017 states and 174180 transitions. Word has length 50 [2019-12-19 02:35:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:32,517 INFO L462 AbstractCegarLoop]: Abstraction has 48017 states and 174180 transitions. [2019-12-19 02:35:32,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:35:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 48017 states and 174180 transitions. [2019-12-19 02:35:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 02:35:32,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:32,537 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] [2019-12-19 02:35:32,537 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:32,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1465416462, now seen corresponding path program 1 times [2019-12-19 02:35:32,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:32,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747408609] [2019-12-19 02:35:32,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:32,671 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-19 02:35:32,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747408609] [2019-12-19 02:35:32,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:32,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:35:32,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560179804] [2019-12-19 02:35:32,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:35:32,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:32,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:35:32,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:32,673 INFO L87 Difference]: Start difference. First operand 48017 states and 174180 transitions. Second operand 6 states. [2019-12-19 02:35:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:33,614 INFO L93 Difference]: Finished difference Result 63757 states and 229380 transitions. [2019-12-19 02:35:33,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:35:33,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 02:35:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:33,806 INFO L225 Difference]: With dead ends: 63757 [2019-12-19 02:35:33,806 INFO L226 Difference]: Without dead ends: 63757 [2019-12-19 02:35:33,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:35:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63757 states. [2019-12-19 02:35:35,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63757 to 59950. [2019-12-19 02:35:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59950 states. [2019-12-19 02:35:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 215673 transitions. [2019-12-19 02:35:38,051 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 215673 transitions. Word has length 54 [2019-12-19 02:35:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:38,051 INFO L462 AbstractCegarLoop]: Abstraction has 59950 states and 215673 transitions. [2019-12-19 02:35:38,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:35:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 215673 transitions. [2019-12-19 02:35:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 02:35:38,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:38,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:35:38,076 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1032599475, now seen corresponding path program 1 times [2019-12-19 02:35:38,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:38,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169217802] [2019-12-19 02:35:38,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:38,163 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-19 02:35:38,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169217802] [2019-12-19 02:35:38,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:38,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:35:38,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044338123] [2019-12-19 02:35:38,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:35:38,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:38,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:35:38,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:35:38,165 INFO L87 Difference]: Start difference. First operand 59950 states and 215673 transitions. Second operand 3 states. [2019-12-19 02:35:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:38,423 INFO L93 Difference]: Finished difference Result 54022 states and 188919 transitions. [2019-12-19 02:35:38,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:35:38,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-19 02:35:38,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:38,538 INFO L225 Difference]: With dead ends: 54022 [2019-12-19 02:35:38,538 INFO L226 Difference]: Without dead ends: 54022 [2019-12-19 02:35:38,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:35:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54022 states. [2019-12-19 02:35:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54022 to 53407. [2019-12-19 02:35:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53407 states. [2019-12-19 02:35:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53407 states to 53407 states and 187038 transitions. [2019-12-19 02:35:39,826 INFO L78 Accepts]: Start accepts. Automaton has 53407 states and 187038 transitions. Word has length 54 [2019-12-19 02:35:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:39,827 INFO L462 AbstractCegarLoop]: Abstraction has 53407 states and 187038 transitions. [2019-12-19 02:35:39,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:35:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 53407 states and 187038 transitions. [2019-12-19 02:35:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 02:35:39,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:39,840 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] [2019-12-19 02:35:39,840 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:39,843 INFO L82 PathProgramCache]: Analyzing trace with hash 228622486, now seen corresponding path program 1 times [2019-12-19 02:35:39,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:39,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926136882] [2019-12-19 02:35:39,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:39,933 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-19 02:35:39,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926136882] [2019-12-19 02:35:39,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:39,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:35:39,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777164360] [2019-12-19 02:35:39,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:35:39,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:39,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:35:39,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:39,936 INFO L87 Difference]: Start difference. First operand 53407 states and 187038 transitions. Second operand 6 states. [2019-12-19 02:35:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:40,688 INFO L93 Difference]: Finished difference Result 68647 states and 237302 transitions. [2019-12-19 02:35:40,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:35:40,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 02:35:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:40,849 INFO L225 Difference]: With dead ends: 68647 [2019-12-19 02:35:40,849 INFO L226 Difference]: Without dead ends: 68079 [2019-12-19 02:35:40,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 02:35:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68079 states. [2019-12-19 02:35:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68079 to 53491. [2019-12-19 02:35:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53491 states. [2019-12-19 02:35:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53491 states to 53491 states and 187735 transitions. [2019-12-19 02:35:42,463 INFO L78 Accepts]: Start accepts. Automaton has 53491 states and 187735 transitions. Word has length 54 [2019-12-19 02:35:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:42,463 INFO L462 AbstractCegarLoop]: Abstraction has 53491 states and 187735 transitions. [2019-12-19 02:35:42,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:35:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 53491 states and 187735 transitions. [2019-12-19 02:35:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:35:42,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:42,474 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] [2019-12-19 02:35:42,474 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:42,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:42,475 INFO L82 PathProgramCache]: Analyzing trace with hash 464639756, now seen corresponding path program 1 times [2019-12-19 02:35:42,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:42,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836734108] [2019-12-19 02:35:42,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:42,545 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-19 02:35:42,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836734108] [2019-12-19 02:35:42,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:42,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:35:42,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022914872] [2019-12-19 02:35:42,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:35:42,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:42,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:35:42,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:42,547 INFO L87 Difference]: Start difference. First operand 53491 states and 187735 transitions. Second operand 4 states. [2019-12-19 02:35:42,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:42,611 INFO L93 Difference]: Finished difference Result 10213 states and 31247 transitions. [2019-12-19 02:35:42,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:35:42,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-19 02:35:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:42,627 INFO L225 Difference]: With dead ends: 10213 [2019-12-19 02:35:42,627 INFO L226 Difference]: Without dead ends: 8508 [2019-12-19 02:35:42,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 02:35:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2019-12-19 02:35:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 8460. [2019-12-19 02:35:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-12-19 02:35:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 25326 transitions. [2019-12-19 02:35:42,737 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 25326 transitions. Word has length 55 [2019-12-19 02:35:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:42,737 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 25326 transitions. [2019-12-19 02:35:42,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:35:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 25326 transitions. [2019-12-19 02:35:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 02:35:42,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:42,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:42,741 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:42,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2059693905, now seen corresponding path program 1 times [2019-12-19 02:35:42,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:42,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393509451] [2019-12-19 02:35:42,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:42,846 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-19 02:35:42,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393509451] [2019-12-19 02:35:42,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:42,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:35:42,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966156757] [2019-12-19 02:35:42,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:35:42,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:42,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:35:42,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:42,848 INFO L87 Difference]: Start difference. First operand 8460 states and 25326 transitions. Second operand 6 states. [2019-12-19 02:35:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:43,563 INFO L93 Difference]: Finished difference Result 10741 states and 31734 transitions. [2019-12-19 02:35:43,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:35:43,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-19 02:35:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:43,582 INFO L225 Difference]: With dead ends: 10741 [2019-12-19 02:35:43,582 INFO L226 Difference]: Without dead ends: 10680 [2019-12-19 02:35:43,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:35:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10680 states. [2019-12-19 02:35:43,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10680 to 9961. [2019-12-19 02:35:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9961 states. [2019-12-19 02:35:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9961 states to 9961 states and 29612 transitions. [2019-12-19 02:35:43,716 INFO L78 Accepts]: Start accepts. Automaton has 9961 states and 29612 transitions. Word has length 62 [2019-12-19 02:35:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:43,716 INFO L462 AbstractCegarLoop]: Abstraction has 9961 states and 29612 transitions. [2019-12-19 02:35:43,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:35:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 9961 states and 29612 transitions. [2019-12-19 02:35:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 02:35:43,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:43,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:43,722 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:43,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:43,722 INFO L82 PathProgramCache]: Analyzing trace with hash -971592892, now seen corresponding path program 1 times [2019-12-19 02:35:43,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:43,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726471292] [2019-12-19 02:35:43,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:43,787 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-19 02:35:43,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726471292] [2019-12-19 02:35:43,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:43,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:35:43,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199104960] [2019-12-19 02:35:43,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:35:43,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:43,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:35:43,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:43,790 INFO L87 Difference]: Start difference. First operand 9961 states and 29612 transitions. Second operand 4 states. [2019-12-19 02:35:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:44,101 INFO L93 Difference]: Finished difference Result 12779 states and 37556 transitions. [2019-12-19 02:35:44,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:35:44,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-19 02:35:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:44,126 INFO L225 Difference]: With dead ends: 12779 [2019-12-19 02:35:44,127 INFO L226 Difference]: Without dead ends: 12779 [2019-12-19 02:35:44,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12779 states. [2019-12-19 02:35:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12779 to 11120. [2019-12-19 02:35:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11120 states. [2019-12-19 02:35:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11120 states to 11120 states and 32800 transitions. [2019-12-19 02:35:44,288 INFO L78 Accepts]: Start accepts. Automaton has 11120 states and 32800 transitions. Word has length 68 [2019-12-19 02:35:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:44,288 INFO L462 AbstractCegarLoop]: Abstraction has 11120 states and 32800 transitions. [2019-12-19 02:35:44,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:35:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 11120 states and 32800 transitions. [2019-12-19 02:35:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 02:35:44,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:44,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:44,298 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:44,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash 273171589, now seen corresponding path program 1 times [2019-12-19 02:35:44,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:44,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707702030] [2019-12-19 02:35:44,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:44,396 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-19 02:35:44,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707702030] [2019-12-19 02:35:44,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:44,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:35:44,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870424212] [2019-12-19 02:35:44,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:35:44,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:44,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:35:44,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:44,398 INFO L87 Difference]: Start difference. First operand 11120 states and 32800 transitions. Second operand 6 states. [2019-12-19 02:35:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:45,048 INFO L93 Difference]: Finished difference Result 12254 states and 35521 transitions. [2019-12-19 02:35:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:35:45,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 02:35:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:45,065 INFO L225 Difference]: With dead ends: 12254 [2019-12-19 02:35:45,065 INFO L226 Difference]: Without dead ends: 12254 [2019-12-19 02:35:45,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:35:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12254 states. [2019-12-19 02:35:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 11959. [2019-12-19 02:35:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11959 states. [2019-12-19 02:35:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11959 states to 11959 states and 34775 transitions. [2019-12-19 02:35:45,221 INFO L78 Accepts]: Start accepts. Automaton has 11959 states and 34775 transitions. Word has length 68 [2019-12-19 02:35:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:45,221 INFO L462 AbstractCegarLoop]: Abstraction has 11959 states and 34775 transitions. [2019-12-19 02:35:45,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:35:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 11959 states and 34775 transitions. [2019-12-19 02:35:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 02:35:45,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:45,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:45,229 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:45,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1804037754, now seen corresponding path program 1 times [2019-12-19 02:35:45,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:45,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209691390] [2019-12-19 02:35:45,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:45,317 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-19 02:35:45,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209691390] [2019-12-19 02:35:45,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:45,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:35:45,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922544723] [2019-12-19 02:35:45,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:35:45,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:45,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:35:45,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:45,318 INFO L87 Difference]: Start difference. First operand 11959 states and 34775 transitions. Second operand 6 states. [2019-12-19 02:35:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:45,874 INFO L93 Difference]: Finished difference Result 13808 states and 38964 transitions. [2019-12-19 02:35:45,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:35:45,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 02:35:45,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:45,894 INFO L225 Difference]: With dead ends: 13808 [2019-12-19 02:35:45,894 INFO L226 Difference]: Without dead ends: 13808 [2019-12-19 02:35:45,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:35:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13808 states. [2019-12-19 02:35:46,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13808 to 12522. [2019-12-19 02:35:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12522 states. [2019-12-19 02:35:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12522 states to 12522 states and 35774 transitions. [2019-12-19 02:35:46,177 INFO L78 Accepts]: Start accepts. Automaton has 12522 states and 35774 transitions. Word has length 68 [2019-12-19 02:35:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:46,177 INFO L462 AbstractCegarLoop]: Abstraction has 12522 states and 35774 transitions. [2019-12-19 02:35:46,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:35:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 12522 states and 35774 transitions. [2019-12-19 02:35:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 02:35:46,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:46,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:46,185 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1592686841, now seen corresponding path program 1 times [2019-12-19 02:35:46,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:46,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071530913] [2019-12-19 02:35:46,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:46,251 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-19 02:35:46,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071530913] [2019-12-19 02:35:46,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:46,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:35:46,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775702352] [2019-12-19 02:35:46,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:35:46,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:46,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:35:46,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:46,253 INFO L87 Difference]: Start difference. First operand 12522 states and 35774 transitions. Second operand 5 states. [2019-12-19 02:35:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:46,627 INFO L93 Difference]: Finished difference Result 16038 states and 45579 transitions. [2019-12-19 02:35:46,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:35:46,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-19 02:35:46,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:46,650 INFO L225 Difference]: With dead ends: 16038 [2019-12-19 02:35:46,650 INFO L226 Difference]: Without dead ends: 16038 [2019-12-19 02:35:46,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:46,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16038 states. [2019-12-19 02:35:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16038 to 14892. [2019-12-19 02:35:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14892 states. [2019-12-19 02:35:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14892 states to 14892 states and 42227 transitions. [2019-12-19 02:35:46,847 INFO L78 Accepts]: Start accepts. Automaton has 14892 states and 42227 transitions. Word has length 68 [2019-12-19 02:35:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:46,848 INFO L462 AbstractCegarLoop]: Abstraction has 14892 states and 42227 transitions. [2019-12-19 02:35:46,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:35:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 14892 states and 42227 transitions. [2019-12-19 02:35:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 02:35:46,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:46,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:46,857 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:46,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:46,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2103221018, now seen corresponding path program 1 times [2019-12-19 02:35:46,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:46,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981727594] [2019-12-19 02:35:46,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:46,925 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-19 02:35:46,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981727594] [2019-12-19 02:35:46,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:46,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:35:46,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856433391] [2019-12-19 02:35:46,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:35:46,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:35:46,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:46,927 INFO L87 Difference]: Start difference. First operand 14892 states and 42227 transitions. Second operand 4 states. [2019-12-19 02:35:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:47,497 INFO L93 Difference]: Finished difference Result 18321 states and 52088 transitions. [2019-12-19 02:35:47,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:35:47,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-19 02:35:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:47,522 INFO L225 Difference]: With dead ends: 18321 [2019-12-19 02:35:47,522 INFO L226 Difference]: Without dead ends: 18144 [2019-12-19 02:35:47,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18144 states. [2019-12-19 02:35:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18144 to 17301. [2019-12-19 02:35:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17301 states. [2019-12-19 02:35:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17301 states to 17301 states and 49086 transitions. [2019-12-19 02:35:47,750 INFO L78 Accepts]: Start accepts. Automaton has 17301 states and 49086 transitions. Word has length 68 [2019-12-19 02:35:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:47,751 INFO L462 AbstractCegarLoop]: Abstraction has 17301 states and 49086 transitions. [2019-12-19 02:35:47,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:35:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 17301 states and 49086 transitions. [2019-12-19 02:35:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 02:35:47,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:47,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:47,761 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:47,761 INFO L82 PathProgramCache]: Analyzing trace with hash 394794919, now seen corresponding path program 1 times [2019-12-19 02:35:47,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:47,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243986189] [2019-12-19 02:35:47,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:47,824 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-19 02:35:47,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243986189] [2019-12-19 02:35:47,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:47,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:35:47,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628311082] [2019-12-19 02:35:47,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:35:47,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:47,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:35:47,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:47,827 INFO L87 Difference]: Start difference. First operand 17301 states and 49086 transitions. Second operand 5 states. [2019-12-19 02:35:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:47,883 INFO L93 Difference]: Finished difference Result 5637 states and 13329 transitions. [2019-12-19 02:35:47,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:35:47,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-19 02:35:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:47,891 INFO L225 Difference]: With dead ends: 5637 [2019-12-19 02:35:47,891 INFO L226 Difference]: Without dead ends: 4851 [2019-12-19 02:35:47,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2019-12-19 02:35:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 4581. [2019-12-19 02:35:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4581 states. [2019-12-19 02:35:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 10496 transitions. [2019-12-19 02:35:47,965 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 10496 transitions. Word has length 68 [2019-12-19 02:35:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:47,965 INFO L462 AbstractCegarLoop]: Abstraction has 4581 states and 10496 transitions. [2019-12-19 02:35:47,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:35:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 10496 transitions. [2019-12-19 02:35:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 02:35:47,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:47,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:47,976 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1157002942, now seen corresponding path program 1 times [2019-12-19 02:35:47,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:47,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148620165] [2019-12-19 02:35:47,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:48,015 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-19 02:35:48,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148620165] [2019-12-19 02:35:48,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:48,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:35:48,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383306537] [2019-12-19 02:35:48,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:35:48,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:48,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:35:48,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:35:48,019 INFO L87 Difference]: Start difference. First operand 4581 states and 10496 transitions. Second operand 3 states. [2019-12-19 02:35:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:48,055 INFO L93 Difference]: Finished difference Result 5732 states and 12928 transitions. [2019-12-19 02:35:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:35:48,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-19 02:35:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:48,063 INFO L225 Difference]: With dead ends: 5732 [2019-12-19 02:35:48,064 INFO L226 Difference]: Without dead ends: 5732 [2019-12-19 02:35:48,064 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-19 02:35:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5732 states. [2019-12-19 02:35:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5732 to 4541. [2019-12-19 02:35:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2019-12-19 02:35:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 10113 transitions. [2019-12-19 02:35:48,124 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 10113 transitions. Word has length 68 [2019-12-19 02:35:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:48,124 INFO L462 AbstractCegarLoop]: Abstraction has 4541 states and 10113 transitions. [2019-12-19 02:35:48,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:35:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 10113 transitions. [2019-12-19 02:35:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-19 02:35:48,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:48,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:48,129 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:48,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:48,129 INFO L82 PathProgramCache]: Analyzing trace with hash 234417652, now seen corresponding path program 1 times [2019-12-19 02:35:48,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:48,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437134334] [2019-12-19 02:35:48,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:48,211 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-19 02:35:48,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437134334] [2019-12-19 02:35:48,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:48,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:35:48,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486278613] [2019-12-19 02:35:48,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:35:48,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:48,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:35:48,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:48,213 INFO L87 Difference]: Start difference. First operand 4541 states and 10113 transitions. Second operand 7 states. [2019-12-19 02:35:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:48,701 INFO L93 Difference]: Finished difference Result 5463 states and 12048 transitions. [2019-12-19 02:35:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:35:48,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-19 02:35:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:48,708 INFO L225 Difference]: With dead ends: 5463 [2019-12-19 02:35:48,708 INFO L226 Difference]: Without dead ends: 5410 [2019-12-19 02:35:48,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 02:35:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2019-12-19 02:35:48,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 4613. [2019-12-19 02:35:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4613 states. [2019-12-19 02:35:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 10165 transitions. [2019-12-19 02:35:48,759 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 10165 transitions. Word has length 74 [2019-12-19 02:35:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:48,759 INFO L462 AbstractCegarLoop]: Abstraction has 4613 states and 10165 transitions. [2019-12-19 02:35:48,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:35:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 10165 transitions. [2019-12-19 02:35:48,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 02:35:48,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:48,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:35:48,764 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:48,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:48,765 INFO L82 PathProgramCache]: Analyzing trace with hash -331039957, now seen corresponding path program 1 times [2019-12-19 02:35:48,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:48,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171479690] [2019-12-19 02:35:48,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:48,831 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-19 02:35:48,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171479690] [2019-12-19 02:35:48,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:48,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:35:48,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993023938] [2019-12-19 02:35:48,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:35:48,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:48,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:35:48,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:48,833 INFO L87 Difference]: Start difference. First operand 4613 states and 10165 transitions. Second operand 5 states. [2019-12-19 02:35:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:49,176 INFO L93 Difference]: Finished difference Result 5630 states and 12352 transitions. [2019-12-19 02:35:49,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:35:49,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 02:35:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:49,185 INFO L225 Difference]: With dead ends: 5630 [2019-12-19 02:35:49,185 INFO L226 Difference]: Without dead ends: 5630 [2019-12-19 02:35:49,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:35:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2019-12-19 02:35:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4745. [2019-12-19 02:35:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2019-12-19 02:35:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 10455 transitions. [2019-12-19 02:35:49,240 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 10455 transitions. Word has length 95 [2019-12-19 02:35:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:49,240 INFO L462 AbstractCegarLoop]: Abstraction has 4745 states and 10455 transitions. [2019-12-19 02:35:49,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:35:49,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 10455 transitions. [2019-12-19 02:35:49,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 02:35:49,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:49,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:35:49,245 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:49,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash -54685289, now seen corresponding path program 2 times [2019-12-19 02:35:49,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:49,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567756523] [2019-12-19 02:35:49,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:49,303 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-19 02:35:49,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567756523] [2019-12-19 02:35:49,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:49,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:35:49,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714060391] [2019-12-19 02:35:49,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:35:49,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:49,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:35:49,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:49,305 INFO L87 Difference]: Start difference. First operand 4745 states and 10455 transitions. Second operand 4 states. [2019-12-19 02:35:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:49,401 INFO L93 Difference]: Finished difference Result 5650 states and 12371 transitions. [2019-12-19 02:35:49,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:35:49,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-19 02:35:49,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:49,409 INFO L225 Difference]: With dead ends: 5650 [2019-12-19 02:35:49,409 INFO L226 Difference]: Without dead ends: 5650 [2019-12-19 02:35:49,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2019-12-19 02:35:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 4903. [2019-12-19 02:35:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4903 states. [2019-12-19 02:35:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4903 states to 4903 states and 10782 transitions. [2019-12-19 02:35:49,473 INFO L78 Accepts]: Start accepts. Automaton has 4903 states and 10782 transitions. Word has length 95 [2019-12-19 02:35:49,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:49,473 INFO L462 AbstractCegarLoop]: Abstraction has 4903 states and 10782 transitions. [2019-12-19 02:35:49,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:35:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 4903 states and 10782 transitions. [2019-12-19 02:35:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:49,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:49,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:35:49,478 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:49,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:49,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2112556238, now seen corresponding path program 1 times [2019-12-19 02:35:49,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:49,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381320180] [2019-12-19 02:35:49,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:49,542 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-19 02:35:49,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381320180] [2019-12-19 02:35:49,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:49,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:35:49,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739822999] [2019-12-19 02:35:49,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:35:49,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:49,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:35:49,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:49,544 INFO L87 Difference]: Start difference. First operand 4903 states and 10782 transitions. Second operand 4 states. [2019-12-19 02:35:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:49,664 INFO L93 Difference]: Finished difference Result 5334 states and 11749 transitions. [2019-12-19 02:35:49,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:35:49,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-19 02:35:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:49,673 INFO L225 Difference]: With dead ends: 5334 [2019-12-19 02:35:49,673 INFO L226 Difference]: Without dead ends: 5334 [2019-12-19 02:35:49,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5334 states. [2019-12-19 02:35:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5334 to 4974. [2019-12-19 02:35:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4974 states. [2019-12-19 02:35:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4974 states to 4974 states and 10933 transitions. [2019-12-19 02:35:49,757 INFO L78 Accepts]: Start accepts. Automaton has 4974 states and 10933 transitions. Word has length 97 [2019-12-19 02:35:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:49,757 INFO L462 AbstractCegarLoop]: Abstraction has 4974 states and 10933 transitions. [2019-12-19 02:35:49,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:35:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4974 states and 10933 transitions. [2019-12-19 02:35:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:49,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:49,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:35:49,765 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:49,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:49,765 INFO L82 PathProgramCache]: Analyzing trace with hash -125074478, now seen corresponding path program 1 times [2019-12-19 02:35:49,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:49,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050947275] [2019-12-19 02:35:49,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:49,847 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-19 02:35:49,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050947275] [2019-12-19 02:35:49,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:49,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:35:49,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500654550] [2019-12-19 02:35:49,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:35:49,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:49,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:35:49,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:49,849 INFO L87 Difference]: Start difference. First operand 4974 states and 10933 transitions. Second operand 6 states. [2019-12-19 02:35:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:50,099 INFO L93 Difference]: Finished difference Result 5114 states and 11237 transitions. [2019-12-19 02:35:50,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:35:50,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-19 02:35:50,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:50,107 INFO L225 Difference]: With dead ends: 5114 [2019-12-19 02:35:50,108 INFO L226 Difference]: Without dead ends: 5114 [2019-12-19 02:35:50,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:35:50,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5114 states. [2019-12-19 02:35:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5114 to 4863. [2019-12-19 02:35:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4863 states. [2019-12-19 02:35:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 10714 transitions. [2019-12-19 02:35:50,200 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 10714 transitions. Word has length 97 [2019-12-19 02:35:50,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:50,201 INFO L462 AbstractCegarLoop]: Abstraction has 4863 states and 10714 transitions. [2019-12-19 02:35:50,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:35:50,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 10714 transitions. [2019-12-19 02:35:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:50,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:50,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:35:50,208 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:50,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:50,209 INFO L82 PathProgramCache]: Analyzing trace with hash 204556725, now seen corresponding path program 1 times [2019-12-19 02:35:50,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:50,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164325098] [2019-12-19 02:35:50,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:50,277 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-19 02:35:50,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164325098] [2019-12-19 02:35:50,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:50,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:35:50,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253495898] [2019-12-19 02:35:50,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:35:50,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:50,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:35:50,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:50,279 INFO L87 Difference]: Start difference. First operand 4863 states and 10714 transitions. Second operand 4 states. [2019-12-19 02:35:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:50,563 INFO L93 Difference]: Finished difference Result 6127 states and 13426 transitions. [2019-12-19 02:35:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:35:50,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-19 02:35:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:50,570 INFO L225 Difference]: With dead ends: 6127 [2019-12-19 02:35:50,571 INFO L226 Difference]: Without dead ends: 6073 [2019-12-19 02:35:50,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2019-12-19 02:35:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 5786. [2019-12-19 02:35:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5786 states. [2019-12-19 02:35:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5786 states to 5786 states and 12705 transitions. [2019-12-19 02:35:50,631 INFO L78 Accepts]: Start accepts. Automaton has 5786 states and 12705 transitions. Word has length 97 [2019-12-19 02:35:50,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:50,631 INFO L462 AbstractCegarLoop]: Abstraction has 5786 states and 12705 transitions. [2019-12-19 02:35:50,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:35:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 5786 states and 12705 transitions. [2019-12-19 02:35:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:50,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:50,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:35:50,637 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:50,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:50,637 INFO L82 PathProgramCache]: Analyzing trace with hash 434832918, now seen corresponding path program 1 times [2019-12-19 02:35:50,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:50,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019583597] [2019-12-19 02:35:50,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:50,725 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-19 02:35:50,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019583597] [2019-12-19 02:35:50,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:50,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:35:50,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213069071] [2019-12-19 02:35:50,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:35:50,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:50,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:35:50,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:50,727 INFO L87 Difference]: Start difference. First operand 5786 states and 12705 transitions. Second operand 7 states. [2019-12-19 02:35:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:51,424 INFO L93 Difference]: Finished difference Result 7229 states and 15841 transitions. [2019-12-19 02:35:51,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 02:35:51,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 02:35:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:51,437 INFO L225 Difference]: With dead ends: 7229 [2019-12-19 02:35:51,438 INFO L226 Difference]: Without dead ends: 7229 [2019-12-19 02:35:51,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-19 02:35:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2019-12-19 02:35:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 6641. [2019-12-19 02:35:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6641 states. [2019-12-19 02:35:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6641 states to 6641 states and 14604 transitions. [2019-12-19 02:35:51,583 INFO L78 Accepts]: Start accepts. Automaton has 6641 states and 14604 transitions. Word has length 97 [2019-12-19 02:35:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:51,583 INFO L462 AbstractCegarLoop]: Abstraction has 6641 states and 14604 transitions. [2019-12-19 02:35:51,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:35:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6641 states and 14604 transitions. [2019-12-19 02:35:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:51,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:51,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:35:51,593 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:51,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:51,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1872652618, now seen corresponding path program 1 times [2019-12-19 02:35:51,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:51,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812254277] [2019-12-19 02:35:51,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:51,744 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-19 02:35:51,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812254277] [2019-12-19 02:35:51,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:51,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:35:51,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202371355] [2019-12-19 02:35:51,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:35:51,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:35:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:35:51,746 INFO L87 Difference]: Start difference. First operand 6641 states and 14604 transitions. Second operand 9 states. [2019-12-19 02:35:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:52,538 INFO L93 Difference]: Finished difference Result 7503 states and 16306 transitions. [2019-12-19 02:35:52,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 02:35:52,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-19 02:35:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:52,548 INFO L225 Difference]: With dead ends: 7503 [2019-12-19 02:35:52,548 INFO L226 Difference]: Without dead ends: 7503 [2019-12-19 02:35:52,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-12-19 02:35:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7503 states. [2019-12-19 02:35:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7503 to 6515. [2019-12-19 02:35:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6515 states. [2019-12-19 02:35:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6515 states to 6515 states and 14219 transitions. [2019-12-19 02:35:52,618 INFO L78 Accepts]: Start accepts. Automaton has 6515 states and 14219 transitions. Word has length 97 [2019-12-19 02:35:52,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:52,618 INFO L462 AbstractCegarLoop]: Abstraction has 6515 states and 14219 transitions. [2019-12-19 02:35:52,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:35:52,619 INFO L276 IsEmpty]: Start isEmpty. Operand 6515 states and 14219 transitions. [2019-12-19 02:35:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:52,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:52,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:35:52,624 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:52,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1661301705, now seen corresponding path program 1 times [2019-12-19 02:35:52,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:52,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589476696] [2019-12-19 02:35:52,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:52,845 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-19 02:35:52,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589476696] [2019-12-19 02:35:52,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:52,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 02:35:52,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005250310] [2019-12-19 02:35:52,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 02:35:52,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:52,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 02:35:52,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:35:52,848 INFO L87 Difference]: Start difference. First operand 6515 states and 14219 transitions. Second operand 10 states. [2019-12-19 02:35:53,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:53,569 INFO L93 Difference]: Finished difference Result 25076 states and 55491 transitions. [2019-12-19 02:35:53,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-19 02:35:53,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-19 02:35:53,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:53,586 INFO L225 Difference]: With dead ends: 25076 [2019-12-19 02:35:53,586 INFO L226 Difference]: Without dead ends: 14105 [2019-12-19 02:35:53,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-19 02:35:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14105 states. [2019-12-19 02:35:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14105 to 5908. [2019-12-19 02:35:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5908 states. [2019-12-19 02:35:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5908 states to 5908 states and 12855 transitions. [2019-12-19 02:35:53,683 INFO L78 Accepts]: Start accepts. Automaton has 5908 states and 12855 transitions. Word has length 97 [2019-12-19 02:35:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:53,683 INFO L462 AbstractCegarLoop]: Abstraction has 5908 states and 12855 transitions. [2019-12-19 02:35:53,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 02:35:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 5908 states and 12855 transitions. [2019-12-19 02:35:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:53,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:53,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:35:53,691 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:53,692 INFO L82 PathProgramCache]: Analyzing trace with hash 827796821, now seen corresponding path program 2 times [2019-12-19 02:35:53,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:53,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206408796] [2019-12-19 02:35:53,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:35:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:35:53,797 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:35:53,797 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:35:54,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:35:54 BasicIcfg [2019-12-19 02:35:54,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:35:54,011 INFO L168 Benchmark]: Toolchain (without parser) took 42329.48 ms. Allocated memory was 137.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 100.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 942.3 MB. Max. memory is 7.1 GB. [2019-12-19 02:35:54,012 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-19 02:35:54,013 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.57 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 156.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-19 02:35:54,013 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.63 ms. Allocated memory is still 201.9 MB. Free memory was 155.7 MB in the beginning and 153.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-19 02:35:54,014 INFO L168 Benchmark]: Boogie Preprocessor took 38.22 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 151.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-19 02:35:54,014 INFO L168 Benchmark]: RCFGBuilder took 887.95 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 106.8 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-19 02:35:54,015 INFO L168 Benchmark]: TraceAbstraction took 40486.16 ms. Allocated memory was 201.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 106.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 883.4 MB. Max. memory is 7.1 GB. [2019-12-19 02:35:54,018 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.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 849.57 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 156.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.63 ms. Allocated memory is still 201.9 MB. Free memory was 155.7 MB in the beginning and 153.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.22 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 151.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 887.95 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 106.8 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40486.16 ms. Allocated memory was 201.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 106.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 883.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L706] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L707] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L708] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L709] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L710] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L711] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L712] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L713] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L714] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L715] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L716] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L717] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L718] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L719] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L720] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 0 pthread_t t1093; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t1093, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 pthread_t t1094; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t1094, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L732] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L733] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L734] 1 z$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L773] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z = z$flush_delayed ? z$mem_tmp : z [L776] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L779] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L817] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 40.0s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7179 SDtfs, 7493 SDslu, 17045 SDs, 0 SdLazy, 5836 SolverSat, 331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 68 SyntacticMatches, 18 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59950occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 60855 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1878 NumberOfCodeBlocks, 1878 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1756 ConstructedInterpolants, 0 QuantifiedInterpolants, 313562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...