/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/mix048_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:00:10,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:00:10,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:00:10,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:00:10,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:00:10,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:00:10,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:00:10,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:00:10,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:00:10,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:00:10,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:00:10,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:00:10,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:00:10,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:00:10,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:00:10,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:00:10,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:00:10,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:00:10,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:00:10,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:00:10,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:00:10,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:00:10,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:00:10,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:00:10,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:00:10,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:00:10,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:00:10,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:00:10,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:00:10,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:00:10,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:00:10,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:00:10,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:00:10,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:00:10,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:00:10,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:00:10,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:00:10,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:00:10,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:00:10,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:00:10,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:00:10,483 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 03:00:10,497 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:00:10,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:00:10,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:00:10,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:00:10,499 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:00:10,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:00:10,499 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:00:10,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:00:10,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:00:10,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:00:10,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:00:10,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:00:10,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:00:10,500 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:00:10,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:00:10,501 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:00:10,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:00:10,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:00:10,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:00:10,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:00:10,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:00:10,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:00:10,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:00:10,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:00:10,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:00:10,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:00:10,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:00:10,503 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:00:10,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:00:10,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:00:10,809 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:00:10,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:00:10,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:00:10,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:00:10,828 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:00:10,828 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_power.oepc.i [2019-12-19 03:00:10,890 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985f7355b/fb23531459a6454796b4bc85c0614df0/FLAG871c30d01 [2019-12-19 03:00:11,486 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:00:11,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_power.oepc.i [2019-12-19 03:00:11,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985f7355b/fb23531459a6454796b4bc85c0614df0/FLAG871c30d01 [2019-12-19 03:00:11,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985f7355b/fb23531459a6454796b4bc85c0614df0 [2019-12-19 03:00:11,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:00:11,743 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:00:11,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:00:11,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:00:11,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:00:11,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:00:11" (1/1) ... [2019-12-19 03:00:11,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:11, skipping insertion in model container [2019-12-19 03:00:11,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:00:11" (1/1) ... [2019-12-19 03:00:11,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:00:11,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:00:12,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:00:12,410 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:00:12,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:00:12,554 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:00:12,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:12 WrapperNode [2019-12-19 03:00:12,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:00:12,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:00:12,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:00:12,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:00:12,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:12" (1/1) ... [2019-12-19 03:00:12,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:12" (1/1) ... [2019-12-19 03:00:12,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:00:12,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:00:12,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:00:12,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:00:12,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:12" (1/1) ... [2019-12-19 03:00:12,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:12" (1/1) ... [2019-12-19 03:00:12,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:12" (1/1) ... [2019-12-19 03:00:12,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:12" (1/1) ... [2019-12-19 03:00:12,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:12" (1/1) ... [2019-12-19 03:00:12,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:12" (1/1) ... [2019-12-19 03:00:12,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:12" (1/1) ... [2019-12-19 03:00:12,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:00:12,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:00:12,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:00:12,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:00:12,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00: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 03:00:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:00:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:00:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:00:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:00:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:00:12,753 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:00:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:00:12,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:00:12,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:00:12,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:00:12,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:00:12,756 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 03:00:13,489 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:00:13,490 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:00:13,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:00:13 BoogieIcfgContainer [2019-12-19 03:00:13,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:00:13,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:00:13,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:00:13,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:00:13,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:00:11" (1/3) ... [2019-12-19 03:00:13,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bbe8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:00:13, skipping insertion in model container [2019-12-19 03:00:13,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:12" (2/3) ... [2019-12-19 03:00:13,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bbe8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:00:13, skipping insertion in model container [2019-12-19 03:00:13,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:00:13" (3/3) ... [2019-12-19 03:00:13,500 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_power.oepc.i [2019-12-19 03:00:13,510 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:00:13,511 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:00:13,519 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:00:13,520 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:00:13,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,569 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,569 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,618 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,627 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,632 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:00:13,649 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:00:13,669 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:00:13,669 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:00:13,669 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:00:13,669 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:00:13,669 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:00:13,669 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:00:13,670 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:00:13,670 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:00:13,683 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions [2019-12-19 03:00:15,652 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-12-19 03:00:15,654 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-12-19 03:00:15,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-19 03:00:15,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:15,662 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] [2019-12-19 03:00:15,663 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:15,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:15,668 INFO L82 PathProgramCache]: Analyzing trace with hash -211488886, now seen corresponding path program 1 times [2019-12-19 03:00:15,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:15,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801567215] [2019-12-19 03:00:15,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:16,125 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 03:00:16,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801567215] [2019-12-19 03:00:16,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:16,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:00:16,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260756283] [2019-12-19 03:00:16,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:00:16,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:16,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:00:16,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:00:16,152 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-12-19 03:00:16,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:16,825 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-12-19 03:00:16,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:00:16,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-19 03:00:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:18,048 INFO L225 Difference]: With dead ends: 33591 [2019-12-19 03:00:18,048 INFO L226 Difference]: Without dead ends: 25703 [2019-12-19 03:00:18,050 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 03:00:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-12-19 03:00:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-12-19 03:00:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-12-19 03:00:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-12-19 03:00:19,431 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-12-19 03:00:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:19,431 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-12-19 03:00:19,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:00:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-12-19 03:00:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 03:00:19,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:19,440 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] [2019-12-19 03:00:19,440 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:19,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:19,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1616921250, now seen corresponding path program 1 times [2019-12-19 03:00:19,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:19,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656598137] [2019-12-19 03:00:19,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:19,558 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 03:00:19,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656598137] [2019-12-19 03:00:19,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:19,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:00:19,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748961049] [2019-12-19 03:00:19,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:00:19,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:19,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:00:19,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:00:19,564 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-12-19 03:00:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:20,897 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-12-19 03:00:20,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:00:20,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 03:00:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:21,130 INFO L225 Difference]: With dead ends: 41081 [2019-12-19 03:00:21,131 INFO L226 Difference]: Without dead ends: 40545 [2019-12-19 03:00:21,132 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 03:00:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-12-19 03:00:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-12-19 03:00:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-12-19 03:00:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-12-19 03:00:24,026 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-12-19 03:00:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:24,027 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-12-19 03:00:24,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:00:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-12-19 03:00:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 03:00:24,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:24,034 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 03:00:24,034 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:24,034 INFO L82 PathProgramCache]: Analyzing trace with hash -7572596, now seen corresponding path program 1 times [2019-12-19 03:00:24,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:24,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278516041] [2019-12-19 03:00:24,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:24,142 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 03:00:24,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278516041] [2019-12-19 03:00:24,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:24,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:00:24,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198572233] [2019-12-19 03:00:24,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:00:24,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:24,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:00:24,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:00:24,146 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-12-19 03:00:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:26,437 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-12-19 03:00:26,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:00:26,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 03:00:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:26,678 INFO L225 Difference]: With dead ends: 49778 [2019-12-19 03:00:26,678 INFO L226 Difference]: Without dead ends: 49274 [2019-12-19 03:00:26,678 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 03:00:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-12-19 03:00:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-12-19 03:00:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-12-19 03:00:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-12-19 03:00:28,128 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-12-19 03:00:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:28,128 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-12-19 03:00:28,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:00:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-12-19 03:00:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 03:00:28,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:28,138 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] [2019-12-19 03:00:28,138 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:28,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2011067022, now seen corresponding path program 1 times [2019-12-19 03:00:28,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:28,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387698288] [2019-12-19 03:00:28,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:28,186 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 03:00:28,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387698288] [2019-12-19 03:00:28,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:28,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:00:28,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470184439] [2019-12-19 03:00:28,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:00:28,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:28,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:00:28,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:00:28,190 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-12-19 03:00:28,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:28,509 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-12-19 03:00:28,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:00:28,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-19 03:00:28,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:29,180 INFO L225 Difference]: With dead ends: 61087 [2019-12-19 03:00:29,181 INFO L226 Difference]: Without dead ends: 61087 [2019-12-19 03:00:29,181 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 03:00:29,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-12-19 03:00:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-12-19 03:00:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-12-19 03:00:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-12-19 03:00:32,346 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-12-19 03:00:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:32,347 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-12-19 03:00:32,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:00:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-12-19 03:00:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 03:00:32,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:32,366 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] [2019-12-19 03:00:32,366 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:32,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:32,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1033937592, now seen corresponding path program 1 times [2019-12-19 03:00:32,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:32,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140165217] [2019-12-19 03:00:32,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:32,537 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 03:00:32,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140165217] [2019-12-19 03:00:32,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:32,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:00:32,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917902235] [2019-12-19 03:00:32,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:00:32,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:32,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:00:32,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:00:32,540 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 6 states. [2019-12-19 03:00:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:33,559 INFO L93 Difference]: Finished difference Result 63756 states and 229379 transitions. [2019-12-19 03:00:33,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:00:33,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-19 03:00:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:33,759 INFO L225 Difference]: With dead ends: 63756 [2019-12-19 03:00:33,759 INFO L226 Difference]: Without dead ends: 63756 [2019-12-19 03:00:33,759 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 03:00:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63756 states. [2019-12-19 03:00:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63756 to 59949. [2019-12-19 03:00:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-12-19 03:00:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-12-19 03:00:37,787 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-12-19 03:00:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:37,787 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-12-19 03:00:37,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:00:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-12-19 03:00:37,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 03:00:37,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:37,804 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] [2019-12-19 03:00:37,804 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:37,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:37,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1464078345, now seen corresponding path program 1 times [2019-12-19 03:00:37,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:37,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414987759] [2019-12-19 03:00:37,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:37,929 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 03:00:37,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414987759] [2019-12-19 03:00:37,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:37,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:00:37,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412593833] [2019-12-19 03:00:37,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:00:37,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:37,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:00:37,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:00:37,932 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-12-19 03:00:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:39,446 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-12-19 03:00:39,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:00:39,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-19 03:00:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:39,630 INFO L225 Difference]: With dead ends: 83685 [2019-12-19 03:00:39,631 INFO L226 Difference]: Without dead ends: 83685 [2019-12-19 03:00:39,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:00:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-12-19 03:00:41,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-12-19 03:00:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-12-19 03:00:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-12-19 03:00:42,057 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-12-19 03:00:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:42,057 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-12-19 03:00:42,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:00:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-12-19 03:00:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 03:00:42,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:42,073 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] [2019-12-19 03:00:42,073 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:42,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:42,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1943385270, now seen corresponding path program 1 times [2019-12-19 03:00:42,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:42,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889395198] [2019-12-19 03:00:42,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:42,136 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 03:00:42,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889395198] [2019-12-19 03:00:42,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:42,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:00:42,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38324728] [2019-12-19 03:00:42,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:00:42,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:42,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:00:42,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:00:42,138 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 3 states. [2019-12-19 03:00:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:42,387 INFO L93 Difference]: Finished difference Result 54021 states and 188918 transitions. [2019-12-19 03:00:42,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:00:42,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-19 03:00:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:42,514 INFO L225 Difference]: With dead ends: 54021 [2019-12-19 03:00:42,514 INFO L226 Difference]: Without dead ends: 54021 [2019-12-19 03:00:42,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:00:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54021 states. [2019-12-19 03:00:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54021 to 53406. [2019-12-19 03:00:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53406 states. [2019-12-19 03:00:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53406 states to 53406 states and 187037 transitions. [2019-12-19 03:00:46,085 INFO L78 Accepts]: Start accepts. Automaton has 53406 states and 187037 transitions. Word has length 53 [2019-12-19 03:00:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:46,086 INFO L462 AbstractCegarLoop]: Abstraction has 53406 states and 187037 transitions. [2019-12-19 03:00:46,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:00:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 53406 states and 187037 transitions. [2019-12-19 03:00:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 03:00:46,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:46,095 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] [2019-12-19 03:00:46,095 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:46,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:46,095 INFO L82 PathProgramCache]: Analyzing trace with hash -870863555, now seen corresponding path program 1 times [2019-12-19 03:00:46,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:46,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821326740] [2019-12-19 03:00:46,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:46,166 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 03:00:46,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821326740] [2019-12-19 03:00:46,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:46,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:00:46,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790489920] [2019-12-19 03:00:46,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:00:46,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:46,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:00:46,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:00:46,168 INFO L87 Difference]: Start difference. First operand 53406 states and 187037 transitions. Second operand 6 states. [2019-12-19 03:00:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:46,916 INFO L93 Difference]: Finished difference Result 68646 states and 237301 transitions. [2019-12-19 03:00:46,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:00:46,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-19 03:00:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:47,063 INFO L225 Difference]: With dead ends: 68646 [2019-12-19 03:00:47,063 INFO L226 Difference]: Without dead ends: 68078 [2019-12-19 03:00:47,064 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 03:00:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68078 states. [2019-12-19 03:00:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68078 to 53490. [2019-12-19 03:00:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53490 states. [2019-12-19 03:00:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53490 states to 53490 states and 187734 transitions. [2019-12-19 03:00:48,588 INFO L78 Accepts]: Start accepts. Automaton has 53490 states and 187734 transitions. Word has length 53 [2019-12-19 03:00:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:48,588 INFO L462 AbstractCegarLoop]: Abstraction has 53490 states and 187734 transitions. [2019-12-19 03:00:48,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:00:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 53490 states and 187734 transitions. [2019-12-19 03:00:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 03:00:48,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:48,599 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 03:00:48,599 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:48,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:48,600 INFO L82 PathProgramCache]: Analyzing trace with hash 57224143, now seen corresponding path program 1 times [2019-12-19 03:00:48,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:48,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785059310] [2019-12-19 03:00:48,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:00:48,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785059310] [2019-12-19 03:00:48,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:48,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:00:48,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403438292] [2019-12-19 03:00:48,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:00:48,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:48,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:00:48,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:00:48,701 INFO L87 Difference]: Start difference. First operand 53490 states and 187734 transitions. Second operand 6 states. [2019-12-19 03:00:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:49,686 INFO L93 Difference]: Finished difference Result 67849 states and 231360 transitions. [2019-12-19 03:00:49,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:00:49,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 03:00:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:49,844 INFO L225 Difference]: With dead ends: 67849 [2019-12-19 03:00:49,844 INFO L226 Difference]: Without dead ends: 67849 [2019-12-19 03:00:49,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:00:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67849 states. [2019-12-19 03:00:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67849 to 59081. [2019-12-19 03:00:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59081 states. [2019-12-19 03:00:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59081 states to 59081 states and 204130 transitions. [2019-12-19 03:00:51,574 INFO L78 Accepts]: Start accepts. Automaton has 59081 states and 204130 transitions. Word has length 54 [2019-12-19 03:00:51,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:51,574 INFO L462 AbstractCegarLoop]: Abstraction has 59081 states and 204130 transitions. [2019-12-19 03:00:51,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:00:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 59081 states and 204130 transitions. [2019-12-19 03:00:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 03:00:51,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:51,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:00:51,585 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:51,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:51,585 INFO L82 PathProgramCache]: Analyzing trace with hash 944727824, now seen corresponding path program 1 times [2019-12-19 03:00:51,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:51,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000225121] [2019-12-19 03:00:51,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:51,657 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 03:00:51,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000225121] [2019-12-19 03:00:51,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:51,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:00:51,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233874304] [2019-12-19 03:00:51,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:00:51,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:51,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:00:51,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:00:51,659 INFO L87 Difference]: Start difference. First operand 59081 states and 204130 transitions. Second operand 4 states. [2019-12-19 03:00:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:51,729 INFO L93 Difference]: Finished difference Result 10212 states and 31246 transitions. [2019-12-19 03:00:51,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:00:51,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-19 03:00:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:51,746 INFO L225 Difference]: With dead ends: 10212 [2019-12-19 03:00:51,746 INFO L226 Difference]: Without dead ends: 8507 [2019-12-19 03:00:51,747 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 03:00:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8507 states. [2019-12-19 03:00:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8507 to 8459. [2019-12-19 03:00:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8459 states. [2019-12-19 03:00:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8459 states to 8459 states and 25325 transitions. [2019-12-19 03:00:51,875 INFO L78 Accepts]: Start accepts. Automaton has 8459 states and 25325 transitions. Word has length 54 [2019-12-19 03:00:51,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:51,876 INFO L462 AbstractCegarLoop]: Abstraction has 8459 states and 25325 transitions. [2019-12-19 03:00:51,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:00:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 8459 states and 25325 transitions. [2019-12-19 03:00:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 03:00:51,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:51,880 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] [2019-12-19 03:00:51,880 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:51,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:51,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1459800295, now seen corresponding path program 1 times [2019-12-19 03:00:51,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:51,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76430089] [2019-12-19 03:00:51,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:51,943 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 03:00:51,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76430089] [2019-12-19 03:00:51,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:51,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:00:51,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520226363] [2019-12-19 03:00:51,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:00:51,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:51,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:00:51,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:00:51,945 INFO L87 Difference]: Start difference. First operand 8459 states and 25325 transitions. Second operand 4 states. [2019-12-19 03:00:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:52,129 INFO L93 Difference]: Finished difference Result 9706 states and 29104 transitions. [2019-12-19 03:00:52,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:00:52,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-19 03:00:52,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:52,150 INFO L225 Difference]: With dead ends: 9706 [2019-12-19 03:00:52,150 INFO L226 Difference]: Without dead ends: 9706 [2019-12-19 03:00:52,151 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 03:00:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2019-12-19 03:00:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 8879. [2019-12-19 03:00:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8879 states. [2019-12-19 03:00:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 26588 transitions. [2019-12-19 03:00:52,365 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 26588 transitions. Word has length 61 [2019-12-19 03:00:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:52,365 INFO L462 AbstractCegarLoop]: Abstraction has 8879 states and 26588 transitions. [2019-12-19 03:00:52,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:00:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 26588 transitions. [2019-12-19 03:00:52,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 03:00:52,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:52,372 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] [2019-12-19 03:00:52,372 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:52,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash 283010040, now seen corresponding path program 1 times [2019-12-19 03:00:52,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:52,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546028603] [2019-12-19 03:00:52,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:52,479 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 03:00:52,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546028603] [2019-12-19 03:00:52,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:52,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:00:52,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377446174] [2019-12-19 03:00:52,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:00:52,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:00:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:00:52,483 INFO L87 Difference]: Start difference. First operand 8879 states and 26588 transitions. Second operand 6 states. [2019-12-19 03:00:52,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:52,906 INFO L93 Difference]: Finished difference Result 11195 states and 33075 transitions. [2019-12-19 03:00:52,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:00:52,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-19 03:00:52,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:52,922 INFO L225 Difference]: With dead ends: 11195 [2019-12-19 03:00:52,922 INFO L226 Difference]: Without dead ends: 11134 [2019-12-19 03:00:52,923 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 03:00:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11134 states. [2019-12-19 03:00:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11134 to 10410. [2019-12-19 03:00:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10410 states. [2019-12-19 03:00:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10410 states to 10410 states and 30942 transitions. [2019-12-19 03:00:53,058 INFO L78 Accepts]: Start accepts. Automaton has 10410 states and 30942 transitions. Word has length 61 [2019-12-19 03:00:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:53,058 INFO L462 AbstractCegarLoop]: Abstraction has 10410 states and 30942 transitions. [2019-12-19 03:00:53,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:00:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 10410 states and 30942 transitions. [2019-12-19 03:00:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:00:53,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:53,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:00:53,064 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:53,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:53,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2090643056, now seen corresponding path program 1 times [2019-12-19 03:00:53,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:53,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417836316] [2019-12-19 03:00:53,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:53,112 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 03:00:53,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417836316] [2019-12-19 03:00:53,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:53,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:00:53,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264700326] [2019-12-19 03:00:53,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:00:53,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:53,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:00:53,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:00:53,114 INFO L87 Difference]: Start difference. First operand 10410 states and 30942 transitions. Second operand 4 states. [2019-12-19 03:00:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:53,584 INFO L93 Difference]: Finished difference Result 15178 states and 44225 transitions. [2019-12-19 03:00:53,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:00:53,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 03:00:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:53,617 INFO L225 Difference]: With dead ends: 15178 [2019-12-19 03:00:53,617 INFO L226 Difference]: Without dead ends: 15178 [2019-12-19 03:00:53,618 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 03:00:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15178 states. [2019-12-19 03:00:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 11727. [2019-12-19 03:00:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-12-19 03:00:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 34516 transitions. [2019-12-19 03:00:53,880 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 34516 transitions. Word has length 67 [2019-12-19 03:00:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:53,880 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 34516 transitions. [2019-12-19 03:00:53,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:00:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 34516 transitions. [2019-12-19 03:00:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:00:53,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:53,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:00:53,893 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:53,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:53,894 INFO L82 PathProgramCache]: Analyzing trace with hash -959559759, now seen corresponding path program 1 times [2019-12-19 03:00:53,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:53,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264150962] [2019-12-19 03:00:53,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:54,012 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 03:00:54,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264150962] [2019-12-19 03:00:54,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:54,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:00:54,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572516827] [2019-12-19 03:00:54,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:00:54,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:54,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:00:54,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:00:54,014 INFO L87 Difference]: Start difference. First operand 11727 states and 34516 transitions. Second operand 6 states. [2019-12-19 03:00:54,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:54,445 INFO L93 Difference]: Finished difference Result 12772 states and 36832 transitions. [2019-12-19 03:00:54,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:00:54,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-19 03:00:54,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:54,463 INFO L225 Difference]: With dead ends: 12772 [2019-12-19 03:00:54,463 INFO L226 Difference]: Without dead ends: 12772 [2019-12-19 03:00:54,464 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 03:00:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12772 states. [2019-12-19 03:00:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 11925. [2019-12-19 03:00:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11925 states. [2019-12-19 03:00:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11925 states to 11925 states and 34759 transitions. [2019-12-19 03:00:54,616 INFO L78 Accepts]: Start accepts. Automaton has 11925 states and 34759 transitions. Word has length 67 [2019-12-19 03:00:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:54,616 INFO L462 AbstractCegarLoop]: Abstraction has 11925 states and 34759 transitions. [2019-12-19 03:00:54,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:00:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 11925 states and 34759 transitions. [2019-12-19 03:00:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:00:54,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:54,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:00:54,623 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:54,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:54,623 INFO L82 PathProgramCache]: Analyzing trace with hash -748208846, now seen corresponding path program 1 times [2019-12-19 03:00:54,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:54,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455810010] [2019-12-19 03:00:54,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:54,689 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 03:00:54,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455810010] [2019-12-19 03:00:54,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:54,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:00:54,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26542019] [2019-12-19 03:00:54,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:00:54,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:54,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:00:54,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:00:54,691 INFO L87 Difference]: Start difference. First operand 11925 states and 34759 transitions. Second operand 5 states. [2019-12-19 03:00:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:55,090 INFO L93 Difference]: Finished difference Result 15220 states and 44029 transitions. [2019-12-19 03:00:55,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:00:55,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-19 03:00:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:55,110 INFO L225 Difference]: With dead ends: 15220 [2019-12-19 03:00:55,111 INFO L226 Difference]: Without dead ends: 15220 [2019-12-19 03:00:55,111 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 03:00:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15220 states. [2019-12-19 03:00:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15220 to 14156. [2019-12-19 03:00:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14156 states. [2019-12-19 03:00:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 40894 transitions. [2019-12-19 03:00:55,416 INFO L78 Accepts]: Start accepts. Automaton has 14156 states and 40894 transitions. Word has length 67 [2019-12-19 03:00:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:55,417 INFO L462 AbstractCegarLoop]: Abstraction has 14156 states and 40894 transitions. [2019-12-19 03:00:55,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:00:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 14156 states and 40894 transitions. [2019-12-19 03:00:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:00:55,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:55,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:00:55,425 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:55,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:55,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1258743023, now seen corresponding path program 1 times [2019-12-19 03:00:55,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:55,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850958825] [2019-12-19 03:00:55,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:55,477 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 03:00:55,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850958825] [2019-12-19 03:00:55,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:55,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:00:55,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500617229] [2019-12-19 03:00:55,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:00:55,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:55,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:00:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:00:55,481 INFO L87 Difference]: Start difference. First operand 14156 states and 40894 transitions. Second operand 4 states. [2019-12-19 03:00:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:56,081 INFO L93 Difference]: Finished difference Result 17525 states and 50589 transitions. [2019-12-19 03:00:56,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:00:56,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 03:00:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:56,105 INFO L225 Difference]: With dead ends: 17525 [2019-12-19 03:00:56,105 INFO L226 Difference]: Without dead ends: 17354 [2019-12-19 03:00:56,106 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 03:00:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17354 states. [2019-12-19 03:00:56,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17354 to 16508. [2019-12-19 03:00:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16508 states. [2019-12-19 03:00:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16508 states to 16508 states and 47592 transitions. [2019-12-19 03:00:56,324 INFO L78 Accepts]: Start accepts. Automaton has 16508 states and 47592 transitions. Word has length 67 [2019-12-19 03:00:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:56,324 INFO L462 AbstractCegarLoop]: Abstraction has 16508 states and 47592 transitions. [2019-12-19 03:00:56,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:00:56,324 INFO L276 IsEmpty]: Start isEmpty. Operand 16508 states and 47592 transitions. [2019-12-19 03:00:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:00:56,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:56,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:00:56,333 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:56,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:56,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1239272914, now seen corresponding path program 1 times [2019-12-19 03:00:56,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:56,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188564652] [2019-12-19 03:00:56,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:56,477 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 03:00:56,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188564652] [2019-12-19 03:00:56,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:56,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:00:56,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332771260] [2019-12-19 03:00:56,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:00:56,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:56,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:00:56,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:00:56,479 INFO L87 Difference]: Start difference. First operand 16508 states and 47592 transitions. Second operand 7 states. [2019-12-19 03:00:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:57,081 INFO L93 Difference]: Finished difference Result 21898 states and 61512 transitions. [2019-12-19 03:00:57,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:00:57,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 03:00:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:57,110 INFO L225 Difference]: With dead ends: 21898 [2019-12-19 03:00:57,111 INFO L226 Difference]: Without dead ends: 21898 [2019-12-19 03:00:57,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:00:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2019-12-19 03:00:57,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 18377. [2019-12-19 03:00:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18377 states. [2019-12-19 03:00:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18377 states to 18377 states and 51655 transitions. [2019-12-19 03:00:57,366 INFO L78 Accepts]: Start accepts. Automaton has 18377 states and 51655 transitions. Word has length 67 [2019-12-19 03:00:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:57,366 INFO L462 AbstractCegarLoop]: Abstraction has 18377 states and 51655 transitions. [2019-12-19 03:00:57,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:00:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 18377 states and 51655 transitions. [2019-12-19 03:00:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:00:57,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:57,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:00:57,375 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash 2126776595, now seen corresponding path program 1 times [2019-12-19 03:00:57,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:57,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521647224] [2019-12-19 03:00:57,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:57,483 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 03:00:57,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521647224] [2019-12-19 03:00:57,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:57,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:00:57,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175553165] [2019-12-19 03:00:57,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:00:57,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:57,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:00:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:00:57,485 INFO L87 Difference]: Start difference. First operand 18377 states and 51655 transitions. Second operand 5 states. [2019-12-19 03:00:57,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:57,549 INFO L93 Difference]: Finished difference Result 5654 states and 13548 transitions. [2019-12-19 03:00:57,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:00:57,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-19 03:00:57,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:57,557 INFO L225 Difference]: With dead ends: 5654 [2019-12-19 03:00:57,557 INFO L226 Difference]: Without dead ends: 4682 [2019-12-19 03:00:57,558 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 03:00:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-12-19 03:00:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 3847. [2019-12-19 03:00:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3847 states. [2019-12-19 03:00:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 9034 transitions. [2019-12-19 03:00:57,623 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 9034 transitions. Word has length 67 [2019-12-19 03:00:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:57,624 INFO L462 AbstractCegarLoop]: Abstraction has 3847 states and 9034 transitions. [2019-12-19 03:00:57,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:00:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 9034 transitions. [2019-12-19 03:00:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:00:57,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:57,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:00:57,631 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:57,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:57,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1987685399, now seen corresponding path program 1 times [2019-12-19 03:00:57,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:57,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115627540] [2019-12-19 03:00:57,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:57,681 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 03:00:57,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115627540] [2019-12-19 03:00:57,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:57,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:00:57,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136831112] [2019-12-19 03:00:57,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:00:57,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:57,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:00:57,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:00:57,683 INFO L87 Difference]: Start difference. First operand 3847 states and 9034 transitions. Second operand 3 states. [2019-12-19 03:00:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:57,728 INFO L93 Difference]: Finished difference Result 4819 states and 11125 transitions. [2019-12-19 03:00:57,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:00:57,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-19 03:00:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:57,735 INFO L225 Difference]: With dead ends: 4819 [2019-12-19 03:00:57,736 INFO L226 Difference]: Without dead ends: 4819 [2019-12-19 03:00:57,736 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 03:00:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-12-19 03:00:57,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 3790. [2019-12-19 03:00:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3790 states. [2019-12-19 03:00:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 8687 transitions. [2019-12-19 03:00:57,796 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 8687 transitions. Word has length 67 [2019-12-19 03:00:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:57,796 INFO L462 AbstractCegarLoop]: Abstraction has 3790 states and 8687 transitions. [2019-12-19 03:00:57,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:00:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 8687 transitions. [2019-12-19 03:00:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 03:00:57,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:57,801 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] [2019-12-19 03:00:57,801 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:57,802 INFO L82 PathProgramCache]: Analyzing trace with hash -788602436, now seen corresponding path program 1 times [2019-12-19 03:00:57,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:57,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448717687] [2019-12-19 03:00:57,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:57,855 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 03:00:57,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448717687] [2019-12-19 03:00:57,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:57,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:00:57,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362544377] [2019-12-19 03:00:57,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:00:57,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:57,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:00:57,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:00:57,857 INFO L87 Difference]: Start difference. First operand 3790 states and 8687 transitions. Second operand 5 states. [2019-12-19 03:00:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:58,035 INFO L93 Difference]: Finished difference Result 4737 states and 10904 transitions. [2019-12-19 03:00:58,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:00:58,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-19 03:00:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:58,042 INFO L225 Difference]: With dead ends: 4737 [2019-12-19 03:00:58,042 INFO L226 Difference]: Without dead ends: 4737 [2019-12-19 03:00:58,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:00:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2019-12-19 03:00:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4176. [2019-12-19 03:00:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4176 states. [2019-12-19 03:00:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 9598 transitions. [2019-12-19 03:00:58,085 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 9598 transitions. Word has length 73 [2019-12-19 03:00:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:58,086 INFO L462 AbstractCegarLoop]: Abstraction has 4176 states and 9598 transitions. [2019-12-19 03:00:58,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:00:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 9598 transitions. [2019-12-19 03:00:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 03:00:58,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:58,090 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] [2019-12-19 03:00:58,090 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:58,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:58,090 INFO L82 PathProgramCache]: Analyzing trace with hash 954207899, now seen corresponding path program 1 times [2019-12-19 03:00:58,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:58,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805823898] [2019-12-19 03:00:58,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:58,165 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 03:00:58,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805823898] [2019-12-19 03:00:58,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:58,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:00:58,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149525578] [2019-12-19 03:00:58,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:00:58,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:58,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:00:58,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:00:58,167 INFO L87 Difference]: Start difference. First operand 4176 states and 9598 transitions. Second operand 7 states. [2019-12-19 03:00:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:58,658 INFO L93 Difference]: Finished difference Result 4873 states and 11063 transitions. [2019-12-19 03:00:58,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:00:58,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-19 03:00:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:58,665 INFO L225 Difference]: With dead ends: 4873 [2019-12-19 03:00:58,665 INFO L226 Difference]: Without dead ends: 4820 [2019-12-19 03:00:58,665 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 03:00:58,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2019-12-19 03:00:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4234. [2019-12-19 03:00:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4234 states. [2019-12-19 03:00:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 9647 transitions. [2019-12-19 03:00:58,757 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 9647 transitions. Word has length 73 [2019-12-19 03:00:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:58,757 INFO L462 AbstractCegarLoop]: Abstraction has 4234 states and 9647 transitions. [2019-12-19 03:00:58,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:00:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 9647 transitions. [2019-12-19 03:00:58,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 03:00:58,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:58,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, 1, 1, 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 03:00:58,762 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:58,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:58,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1009148223, now seen corresponding path program 1 times [2019-12-19 03:00:58,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:58,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068461191] [2019-12-19 03:00:58,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:58,815 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 03:00:58,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068461191] [2019-12-19 03:00:58,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:58,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:00:58,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136544451] [2019-12-19 03:00:58,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:00:58,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:58,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:00:58,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:00:58,818 INFO L87 Difference]: Start difference. First operand 4234 states and 9647 transitions. Second operand 3 states. [2019-12-19 03:00:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:58,978 INFO L93 Difference]: Finished difference Result 5804 states and 12895 transitions. [2019-12-19 03:00:58,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:00:58,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-19 03:00:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:58,985 INFO L225 Difference]: With dead ends: 5804 [2019-12-19 03:00:58,985 INFO L226 Difference]: Without dead ends: 5513 [2019-12-19 03:00:58,986 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 03:00:58,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2019-12-19 03:00:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5040. [2019-12-19 03:00:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5040 states. [2019-12-19 03:00:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5040 states to 5040 states and 11341 transitions. [2019-12-19 03:00:59,037 INFO L78 Accepts]: Start accepts. Automaton has 5040 states and 11341 transitions. Word has length 94 [2019-12-19 03:00:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:59,037 INFO L462 AbstractCegarLoop]: Abstraction has 5040 states and 11341 transitions. [2019-12-19 03:00:59,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:00:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 5040 states and 11341 transitions. [2019-12-19 03:00:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 03:00:59,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:59,042 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] [2019-12-19 03:00:59,043 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:59,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:59,043 INFO L82 PathProgramCache]: Analyzing trace with hash -725997759, now seen corresponding path program 1 times [2019-12-19 03:00:59,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:59,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567486737] [2019-12-19 03:00:59,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:59,105 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 03:00:59,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567486737] [2019-12-19 03:00:59,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:59,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:00:59,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626747065] [2019-12-19 03:00:59,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:00:59,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:59,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:00:59,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:00:59,107 INFO L87 Difference]: Start difference. First operand 5040 states and 11341 transitions. Second operand 4 states. [2019-12-19 03:00:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:59,203 INFO L93 Difference]: Finished difference Result 5316 states and 12003 transitions. [2019-12-19 03:00:59,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:00:59,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-19 03:00:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:59,210 INFO L225 Difference]: With dead ends: 5316 [2019-12-19 03:00:59,210 INFO L226 Difference]: Without dead ends: 5316 [2019-12-19 03:00:59,210 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 03:00:59,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2019-12-19 03:00:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4773. [2019-12-19 03:00:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4773 states. [2019-12-19 03:00:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 10838 transitions. [2019-12-19 03:00:59,260 INFO L78 Accepts]: Start accepts. Automaton has 4773 states and 10838 transitions. Word has length 94 [2019-12-19 03:00:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:59,260 INFO L462 AbstractCegarLoop]: Abstraction has 4773 states and 10838 transitions. [2019-12-19 03:00:59,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:00:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4773 states and 10838 transitions. [2019-12-19 03:00:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:00:59,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:59,265 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] [2019-12-19 03:00:59,265 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:59,265 INFO L82 PathProgramCache]: Analyzing trace with hash 574359335, now seen corresponding path program 1 times [2019-12-19 03:00:59,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:59,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637889257] [2019-12-19 03:00:59,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:59,325 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 03:00:59,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637889257] [2019-12-19 03:00:59,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:59,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:00:59,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592957028] [2019-12-19 03:00:59,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:00:59,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:59,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:00:59,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:00:59,327 INFO L87 Difference]: Start difference. First operand 4773 states and 10838 transitions. Second operand 5 states. [2019-12-19 03:00:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:59,454 INFO L93 Difference]: Finished difference Result 5452 states and 12346 transitions. [2019-12-19 03:00:59,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:00:59,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 03:00:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:59,460 INFO L225 Difference]: With dead ends: 5452 [2019-12-19 03:00:59,460 INFO L226 Difference]: Without dead ends: 5452 [2019-12-19 03:00:59,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 03:00:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-12-19 03:00:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4174. [2019-12-19 03:00:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-12-19 03:00:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 9445 transitions. [2019-12-19 03:00:59,505 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 9445 transitions. Word has length 96 [2019-12-19 03:00:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:59,505 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 9445 transitions. [2019-12-19 03:00:59,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:00:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 9445 transitions. [2019-12-19 03:00:59,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:00:59,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:59,509 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] [2019-12-19 03:00:59,509 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:59,509 INFO L82 PathProgramCache]: Analyzing trace with hash 585675462, now seen corresponding path program 1 times [2019-12-19 03:00:59,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:59,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83963690] [2019-12-19 03:00:59,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:00:59,576 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 03:00:59,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83963690] [2019-12-19 03:00:59,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:00:59,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:00:59,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193094049] [2019-12-19 03:00:59,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:00:59,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:00:59,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:00:59,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:00:59,578 INFO L87 Difference]: Start difference. First operand 4174 states and 9445 transitions. Second operand 4 states. [2019-12-19 03:00:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:00:59,820 INFO L93 Difference]: Finished difference Result 4884 states and 10994 transitions. [2019-12-19 03:00:59,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:00:59,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-19 03:00:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:00:59,828 INFO L225 Difference]: With dead ends: 4884 [2019-12-19 03:00:59,828 INFO L226 Difference]: Without dead ends: 4828 [2019-12-19 03:00:59,828 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 03:00:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4828 states. [2019-12-19 03:00:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 4625. [2019-12-19 03:00:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-12-19 03:00:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 10444 transitions. [2019-12-19 03:00:59,873 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 10444 transitions. Word has length 96 [2019-12-19 03:00:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:00:59,874 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 10444 transitions. [2019-12-19 03:00:59,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:00:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 10444 transitions. [2019-12-19 03:00:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:00:59,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:00:59,882 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] [2019-12-19 03:00:59,882 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:00:59,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:00:59,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1491533881, now seen corresponding path program 1 times [2019-12-19 03:00:59,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:00:59,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109177153] [2019-12-19 03:00:59,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:00:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:01:00,079 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 03:01:00,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109177153] [2019-12-19 03:01:00,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:01:00,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 03:01:00,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023333083] [2019-12-19 03:01:00,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 03:01:00,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:01:00,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 03:01:00,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:01:00,082 INFO L87 Difference]: Start difference. First operand 4625 states and 10444 transitions. Second operand 9 states. [2019-12-19 03:01:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:01:00,827 INFO L93 Difference]: Finished difference Result 6285 states and 13941 transitions. [2019-12-19 03:01:00,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 03:01:00,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-19 03:01:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:01:00,836 INFO L225 Difference]: With dead ends: 6285 [2019-12-19 03:01:00,836 INFO L226 Difference]: Without dead ends: 6285 [2019-12-19 03:01:00,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 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 03:01:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6285 states. [2019-12-19 03:01:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 5107. [2019-12-19 03:01:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2019-12-19 03:01:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 11442 transitions. [2019-12-19 03:01:00,895 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 11442 transitions. Word has length 96 [2019-12-19 03:01:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:01:00,895 INFO L462 AbstractCegarLoop]: Abstraction has 5107 states and 11442 transitions. [2019-12-19 03:01:00,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 03:01:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 11442 transitions. [2019-12-19 03:01:00,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:01:00,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:01:00,901 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] [2019-12-19 03:01:00,901 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:01:00,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:01:00,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1280182968, now seen corresponding path program 1 times [2019-12-19 03:01:00,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:01:00,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184326678] [2019-12-19 03:01:00,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:01:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:01:01,004 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 03:01:01,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184326678] [2019-12-19 03:01:01,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:01:01,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:01:01,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062240479] [2019-12-19 03:01:01,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:01:01,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:01:01,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:01:01,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:01:01,006 INFO L87 Difference]: Start difference. First operand 5107 states and 11442 transitions. Second operand 5 states. [2019-12-19 03:01:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:01:01,049 INFO L93 Difference]: Finished difference Result 5107 states and 11433 transitions. [2019-12-19 03:01:01,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:01:01,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 03:01:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:01:01,056 INFO L225 Difference]: With dead ends: 5107 [2019-12-19 03:01:01,056 INFO L226 Difference]: Without dead ends: 5107 [2019-12-19 03:01:01,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:01:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5107 states. [2019-12-19 03:01:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5107 to 4871. [2019-12-19 03:01:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4871 states. [2019-12-19 03:01:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 10906 transitions. [2019-12-19 03:01:01,104 INFO L78 Accepts]: Start accepts. Automaton has 4871 states and 10906 transitions. Word has length 96 [2019-12-19 03:01:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:01:01,104 INFO L462 AbstractCegarLoop]: Abstraction has 4871 states and 10906 transitions. [2019-12-19 03:01:01,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:01:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 10906 transitions. [2019-12-19 03:01:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:01:01,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:01:01,112 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] [2019-12-19 03:01:01,112 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:01:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:01:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash -392679287, now seen corresponding path program 1 times [2019-12-19 03:01:01,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:01:01,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782168010] [2019-12-19 03:01:01,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:01:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:01:01,256 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 03:01:01,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782168010] [2019-12-19 03:01:01,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:01:01,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 03:01:01,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115592900] [2019-12-19 03:01:01,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 03:01:01,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:01:01,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 03:01:01,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:01:01,258 INFO L87 Difference]: Start difference. First operand 4871 states and 10906 transitions. Second operand 10 states. [2019-12-19 03:01:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:01:01,754 INFO L93 Difference]: Finished difference Result 14875 states and 33775 transitions. [2019-12-19 03:01:01,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 03:01:01,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-19 03:01:01,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:01:01,766 INFO L225 Difference]: With dead ends: 14875 [2019-12-19 03:01:01,766 INFO L226 Difference]: Without dead ends: 9691 [2019-12-19 03:01:01,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 03:01:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2019-12-19 03:01:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 4841. [2019-12-19 03:01:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4841 states. [2019-12-19 03:01:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 10747 transitions. [2019-12-19 03:01:01,836 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 10747 transitions. Word has length 96 [2019-12-19 03:01:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:01:01,836 INFO L462 AbstractCegarLoop]: Abstraction has 4841 states and 10747 transitions. [2019-12-19 03:01:01,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 03:01:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 10747 transitions. [2019-12-19 03:01:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:01:01,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:01:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:01:01,840 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:01:01,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:01:01,841 INFO L82 PathProgramCache]: Analyzing trace with hash -325970013, now seen corresponding path program 2 times [2019-12-19 03:01:01,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:01:01,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743555566] [2019-12-19 03:01:01,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:01:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:01:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:01:01,938 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 03:01:01,939 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 03:01:02,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:01:02 BasicIcfg [2019-12-19 03:01:02,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 03:01:02,159 INFO L168 Benchmark]: Toolchain (without parser) took 50416.29 ms. Allocated memory was 144.2 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 100.5 MB in the beginning and 890.4 MB in the end (delta: -789.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-19 03:01:02,160 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.2 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 03:01:02,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.73 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 153.4 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-19 03:01:02,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.89 ms. Allocated memory is still 201.3 MB. Free memory was 153.4 MB in the beginning and 151.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-19 03:01:02,162 INFO L168 Benchmark]: Boogie Preprocessor took 37.62 ms. Allocated memory is still 201.3 MB. Free memory was 151.3 MB in the beginning and 148.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-19 03:01:02,162 INFO L168 Benchmark]: RCFGBuilder took 820.42 ms. Allocated memory is still 201.3 MB. Free memory was 148.5 MB in the beginning and 104.3 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-19 03:01:02,163 INFO L168 Benchmark]: TraceAbstraction took 48662.36 ms. Allocated memory was 201.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 103.6 MB in the beginning and 890.4 MB in the end (delta: -786.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-19 03:01:02,166 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 144.2 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 808.73 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 153.4 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.89 ms. Allocated memory is still 201.3 MB. Free memory was 153.4 MB in the beginning and 151.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.62 ms. Allocated memory is still 201.3 MB. Free memory was 151.3 MB in the beginning and 148.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.42 ms. Allocated memory is still 201.3 MB. Free memory was 148.5 MB in the beginning and 104.3 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48662.36 ms. Allocated memory was 201.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 103.6 MB in the beginning and 890.4 MB in the end (delta: -786.8 MB). Peak memory consumption was 1.5 GB. 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1281; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 pthread_t t1282; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] FCALL, FORK 0 pthread_create(&t1282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L809] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 48.2s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7729 SDtfs, 8592 SDslu, 17159 SDs, 0 SdLazy, 6487 SolverSat, 411 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 75 SyntacticMatches, 17 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 84839 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1997 NumberOfCodeBlocks, 1997 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1873 ConstructedInterpolants, 0 QuantifiedInterpolants, 365587 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...