/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix009_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 00:24:59,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 00:24:59,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 00:24:59,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 00:24:59,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 00:24:59,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 00:24:59,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 00:24:59,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 00:24:59,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 00:24:59,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 00:24:59,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 00:24:59,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 00:24:59,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 00:24:59,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 00:24:59,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 00:24:59,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 00:24:59,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 00:24:59,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 00:24:59,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 00:24:59,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 00:24:59,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 00:24:59,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 00:24:59,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 00:24:59,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 00:24:59,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 00:24:59,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 00:24:59,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 00:24:59,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 00:24:59,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 00:24:59,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 00:24:59,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 00:24:59,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 00:24:59,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 00:24:59,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 00:24:59,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 00:24:59,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 00:24:59,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 00:24:59,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 00:24:59,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 00:24:59,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 00:24:59,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 00:24:59,508 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-MCR.epf [2019-12-28 00:24:59,527 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 00:24:59,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 00:24:59,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 00:24:59,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 00:24:59,530 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 00:24:59,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 00:24:59,530 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 00:24:59,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 00:24:59,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 00:24:59,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 00:24:59,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 00:24:59,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 00:24:59,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 00:24:59,533 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 00:24:59,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 00:24:59,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 00:24:59,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 00:24:59,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 00:24:59,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 00:24:59,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 00:24:59,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 00:24:59,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 00:24:59,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 00:24:59,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 00:24:59,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 00:24:59,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 00:24:59,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 00:24:59,536 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 00:24:59,536 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 00:24:59,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 00:24:59,537 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 00:24:59,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 00:24:59,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 00:24:59,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 00:24:59,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 00:24:59,812 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 00:24:59,813 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 00:24:59,813 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_power.oepc.i [2019-12-28 00:24:59,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e32112dba/84a486e4a4f44fc8a8378ccb76da0c10/FLAG842593f3b [2019-12-28 00:25:00,454 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 00:25:00,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_power.oepc.i [2019-12-28 00:25:00,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e32112dba/84a486e4a4f44fc8a8378ccb76da0c10/FLAG842593f3b [2019-12-28 00:25:00,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e32112dba/84a486e4a4f44fc8a8378ccb76da0c10 [2019-12-28 00:25:00,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 00:25:00,748 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 00:25:00,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 00:25:00,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 00:25:00,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 00:25:00,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:25:00" (1/1) ... [2019-12-28 00:25:00,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75debd2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:00, skipping insertion in model container [2019-12-28 00:25:00,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:25:00" (1/1) ... [2019-12-28 00:25:00,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 00:25:00,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 00:25:01,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 00:25:01,352 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 00:25:01,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 00:25:01,500 INFO L208 MainTranslator]: Completed translation [2019-12-28 00:25:01,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:01 WrapperNode [2019-12-28 00:25:01,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 00:25:01,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 00:25:01,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 00:25:01,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 00:25:01,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:01" (1/1) ... [2019-12-28 00:25:01,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:01" (1/1) ... [2019-12-28 00:25:01,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 00:25:01,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 00:25:01,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 00:25:01,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 00:25:01,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:01" (1/1) ... [2019-12-28 00:25:01,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:01" (1/1) ... [2019-12-28 00:25:01,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:01" (1/1) ... [2019-12-28 00:25:01,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:01" (1/1) ... [2019-12-28 00:25:01,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:01" (1/1) ... [2019-12-28 00:25:01,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:01" (1/1) ... [2019-12-28 00:25:01,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:01" (1/1) ... [2019-12-28 00:25:01,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 00:25:01,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 00:25:01,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 00:25:01,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 00:25:01,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:01" (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-28 00:25:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 00:25:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 00:25:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 00:25:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 00:25:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 00:25:01,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 00:25:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 00:25:01,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 00:25:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 00:25:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 00:25:01,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 00:25:01,689 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 00:25:02,426 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 00:25:02,427 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 00:25:02,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:25:02 BoogieIcfgContainer [2019-12-28 00:25:02,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 00:25:02,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 00:25:02,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 00:25:02,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 00:25:02,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 12:25:00" (1/3) ... [2019-12-28 00:25:02,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74017dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:25:02, skipping insertion in model container [2019-12-28 00:25:02,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:01" (2/3) ... [2019-12-28 00:25:02,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74017dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:25:02, skipping insertion in model container [2019-12-28 00:25:02,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:25:02" (3/3) ... [2019-12-28 00:25:02,437 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_power.oepc.i [2019-12-28 00:25:02,448 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 00:25:02,449 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 00:25:02,457 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 00:25:02,458 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 00:25:02,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,497 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,498 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,498 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,499 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,499 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,572 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,575 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:02,591 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 00:25:02,608 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 00:25:02,608 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 00:25:02,608 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 00:25:02,608 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 00:25:02,608 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 00:25:02,609 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 00:25:02,609 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 00:25:02,609 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 00:25:02,624 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 184 transitions [2019-12-28 00:25:04,724 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32594 states. [2019-12-28 00:25:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 32594 states. [2019-12-28 00:25:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-28 00:25:04,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:04,737 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] [2019-12-28 00:25:04,738 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:04,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1842126657, now seen corresponding path program 1 times [2019-12-28 00:25:04,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:04,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282218246] [2019-12-28 00:25:04,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:05,115 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-28 00:25:05,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282218246] [2019-12-28 00:25:05,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:05,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:25:05,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1286061270] [2019-12-28 00:25:05,121 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:05,130 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:05,157 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-28 00:25:05,157 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:05,164 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:05,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:25:05,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:05,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:25:05,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:25:05,187 INFO L87 Difference]: Start difference. First operand 32594 states. Second operand 4 states. [2019-12-28 00:25:06,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:06,621 INFO L93 Difference]: Finished difference Result 33594 states and 129571 transitions. [2019-12-28 00:25:06,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:25:06,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-28 00:25:06,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:06,901 INFO L225 Difference]: With dead ends: 33594 [2019-12-28 00:25:06,902 INFO L226 Difference]: Without dead ends: 25706 [2019-12-28 00:25:06,903 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-28 00:25:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25706 states. [2019-12-28 00:25:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25706 to 25706. [2019-12-28 00:25:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25706 states. [2019-12-28 00:25:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25706 states to 25706 states and 99587 transitions. [2019-12-28 00:25:08,689 INFO L78 Accepts]: Start accepts. Automaton has 25706 states and 99587 transitions. Word has length 37 [2019-12-28 00:25:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:08,691 INFO L462 AbstractCegarLoop]: Abstraction has 25706 states and 99587 transitions. [2019-12-28 00:25:08,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:25:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 25706 states and 99587 transitions. [2019-12-28 00:25:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 00:25:08,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:08,706 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-28 00:25:08,707 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash 994831418, now seen corresponding path program 1 times [2019-12-28 00:25:08,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:08,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906926204] [2019-12-28 00:25:08,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:08,875 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-28 00:25:08,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906926204] [2019-12-28 00:25:08,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:08,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:25:08,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [651218365] [2019-12-28 00:25:08,877 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:08,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:08,891 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 49 transitions. [2019-12-28 00:25:08,892 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:08,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:08,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:25:08,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:08,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:25:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:25:08,895 INFO L87 Difference]: Start difference. First operand 25706 states and 99587 transitions. Second operand 5 states. [2019-12-28 00:25:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:09,868 INFO L93 Difference]: Finished difference Result 41084 states and 150434 transitions. [2019-12-28 00:25:09,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:25:09,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-28 00:25:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:11,348 INFO L225 Difference]: With dead ends: 41084 [2019-12-28 00:25:11,348 INFO L226 Difference]: Without dead ends: 40548 [2019-12-28 00:25:11,349 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-28 00:25:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40548 states. [2019-12-28 00:25:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40548 to 38928. [2019-12-28 00:25:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38928 states. [2019-12-28 00:25:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38928 states to 38928 states and 143584 transitions. [2019-12-28 00:25:12,825 INFO L78 Accepts]: Start accepts. Automaton has 38928 states and 143584 transitions. Word has length 49 [2019-12-28 00:25:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:12,827 INFO L462 AbstractCegarLoop]: Abstraction has 38928 states and 143584 transitions. [2019-12-28 00:25:12,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:25:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 38928 states and 143584 transitions. [2019-12-28 00:25:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 00:25:12,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:12,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:25:12,838 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:12,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:12,838 INFO L82 PathProgramCache]: Analyzing trace with hash -351997153, now seen corresponding path program 1 times [2019-12-28 00:25:12,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:12,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025833361] [2019-12-28 00:25:12,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:12,994 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-28 00:25:12,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025833361] [2019-12-28 00:25:12,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:12,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:25:12,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1173103953] [2019-12-28 00:25:12,996 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:13,002 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:13,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 50 transitions. [2019-12-28 00:25:13,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:13,009 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:13,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:25:13,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:13,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:25:13,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:25:13,010 INFO L87 Difference]: Start difference. First operand 38928 states and 143584 transitions. Second operand 5 states. [2019-12-28 00:25:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:13,932 INFO L93 Difference]: Finished difference Result 49781 states and 180636 transitions. [2019-12-28 00:25:13,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:25:13,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-28 00:25:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:14,093 INFO L225 Difference]: With dead ends: 49781 [2019-12-28 00:25:14,093 INFO L226 Difference]: Without dead ends: 49277 [2019-12-28 00:25:14,093 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-28 00:25:14,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49277 states. [2019-12-28 00:25:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49277 to 42680. [2019-12-28 00:25:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42680 states. [2019-12-28 00:25:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42680 states to 42680 states and 156595 transitions. [2019-12-28 00:25:17,129 INFO L78 Accepts]: Start accepts. Automaton has 42680 states and 156595 transitions. Word has length 50 [2019-12-28 00:25:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:17,130 INFO L462 AbstractCegarLoop]: Abstraction has 42680 states and 156595 transitions. [2019-12-28 00:25:17,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:25:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 42680 states and 156595 transitions. [2019-12-28 00:25:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 00:25:17,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:17,141 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] [2019-12-28 00:25:17,141 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:17,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2004382981, now seen corresponding path program 1 times [2019-12-28 00:25:17,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:17,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360391582] [2019-12-28 00:25:17,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:17,188 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-28 00:25:17,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360391582] [2019-12-28 00:25:17,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:17,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:25:17,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [663770760] [2019-12-28 00:25:17,189 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:17,196 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:17,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 52 transitions. [2019-12-28 00:25:17,202 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:17,202 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:17,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:25:17,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:17,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:25:17,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:25:17,204 INFO L87 Difference]: Start difference. First operand 42680 states and 156595 transitions. Second operand 3 states. [2019-12-28 00:25:17,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:17,939 INFO L93 Difference]: Finished difference Result 61090 states and 221433 transitions. [2019-12-28 00:25:17,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:25:17,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-28 00:25:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:18,123 INFO L225 Difference]: With dead ends: 61090 [2019-12-28 00:25:18,123 INFO L226 Difference]: Without dead ends: 61090 [2019-12-28 00:25:18,123 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-28 00:25:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61090 states. [2019-12-28 00:25:21,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61090 to 48019. [2019-12-28 00:25:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48019 states. [2019-12-28 00:25:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48019 states to 48019 states and 174182 transitions. [2019-12-28 00:25:21,125 INFO L78 Accepts]: Start accepts. Automaton has 48019 states and 174182 transitions. Word has length 52 [2019-12-28 00:25:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:21,125 INFO L462 AbstractCegarLoop]: Abstraction has 48019 states and 174182 transitions. [2019-12-28 00:25:21,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:25:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 48019 states and 174182 transitions. [2019-12-28 00:25:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:25:21,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:21,142 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] [2019-12-28 00:25:21,142 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:21,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash -189838484, now seen corresponding path program 1 times [2019-12-28 00:25:21,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:21,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953035556] [2019-12-28 00:25:21,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:21,258 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-28 00:25:21,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953035556] [2019-12-28 00:25:21,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:21,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:25:21,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1029937550] [2019-12-28 00:25:21,259 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:21,266 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:21,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 68 transitions. [2019-12-28 00:25:21,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:21,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:21,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:25:21,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:21,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:25:21,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:25:21,275 INFO L87 Difference]: Start difference. First operand 48019 states and 174182 transitions. Second operand 6 states. [2019-12-28 00:25:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:22,191 INFO L93 Difference]: Finished difference Result 63759 states and 229382 transitions. [2019-12-28 00:25:22,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:25:22,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-28 00:25:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:22,338 INFO L225 Difference]: With dead ends: 63759 [2019-12-28 00:25:22,339 INFO L226 Difference]: Without dead ends: 63759 [2019-12-28 00:25:22,339 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-28 00:25:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63759 states. [2019-12-28 00:25:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63759 to 59952. [2019-12-28 00:25:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59952 states. [2019-12-28 00:25:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59952 states to 59952 states and 215675 transitions. [2019-12-28 00:25:26,935 INFO L78 Accepts]: Start accepts. Automaton has 59952 states and 215675 transitions. Word has length 56 [2019-12-28 00:25:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:26,935 INFO L462 AbstractCegarLoop]: Abstraction has 59952 states and 215675 transitions. [2019-12-28 00:25:26,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:25:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 59952 states and 215675 transitions. [2019-12-28 00:25:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:25:26,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:26,953 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] [2019-12-28 00:25:26,953 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:26,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:26,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1986789843, now seen corresponding path program 1 times [2019-12-28 00:25:26,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:26,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460290447] [2019-12-28 00:25:26,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:27,148 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-28 00:25:27,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460290447] [2019-12-28 00:25:27,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:27,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:25:27,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [30170223] [2019-12-28 00:25:27,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:27,156 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:27,163 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 68 transitions. [2019-12-28 00:25:27,163 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:27,163 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:27,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:25:27,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:27,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:25:27,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:25:27,165 INFO L87 Difference]: Start difference. First operand 59952 states and 215675 transitions. Second operand 7 states. [2019-12-28 00:25:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:28,722 INFO L93 Difference]: Finished difference Result 83688 states and 290100 transitions. [2019-12-28 00:25:28,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 00:25:28,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-28 00:25:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:28,986 INFO L225 Difference]: With dead ends: 83688 [2019-12-28 00:25:28,986 INFO L226 Difference]: Without dead ends: 83688 [2019-12-28 00:25:28,987 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-28 00:25:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83688 states. [2019-12-28 00:25:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83688 to 71015. [2019-12-28 00:25:30,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71015 states. [2019-12-28 00:25:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71015 states to 71015 states and 249889 transitions. [2019-12-28 00:25:30,711 INFO L78 Accepts]: Start accepts. Automaton has 71015 states and 249889 transitions. Word has length 56 [2019-12-28 00:25:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:30,711 INFO L462 AbstractCegarLoop]: Abstraction has 71015 states and 249889 transitions. [2019-12-28 00:25:30,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:25:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 71015 states and 249889 transitions. [2019-12-28 00:25:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:25:30,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:30,727 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] [2019-12-28 00:25:30,727 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:30,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1099286162, now seen corresponding path program 1 times [2019-12-28 00:25:30,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:30,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637011727] [2019-12-28 00:25:30,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:30,794 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-28 00:25:30,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637011727] [2019-12-28 00:25:30,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:30,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:25:30,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1166744763] [2019-12-28 00:25:30,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:30,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:30,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 68 transitions. [2019-12-28 00:25:30,810 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:30,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:30,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:25:30,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:30,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:25:30,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:25:30,812 INFO L87 Difference]: Start difference. First operand 71015 states and 249889 transitions. Second operand 3 states. [2019-12-28 00:25:31,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:31,587 INFO L93 Difference]: Finished difference Result 54024 states and 188921 transitions. [2019-12-28 00:25:31,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:25:31,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-28 00:25:31,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:31,708 INFO L225 Difference]: With dead ends: 54024 [2019-12-28 00:25:31,708 INFO L226 Difference]: Without dead ends: 54024 [2019-12-28 00:25:31,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:25:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54024 states. [2019-12-28 00:25:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54024 to 53409. [2019-12-28 00:25:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53409 states. [2019-12-28 00:25:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53409 states to 53409 states and 187040 transitions. [2019-12-28 00:25:32,707 INFO L78 Accepts]: Start accepts. Automaton has 53409 states and 187040 transitions. Word has length 56 [2019-12-28 00:25:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:32,707 INFO L462 AbstractCegarLoop]: Abstraction has 53409 states and 187040 transitions. [2019-12-28 00:25:32,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:25:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 53409 states and 187040 transitions. [2019-12-28 00:25:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:25:33,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:33,046 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] [2019-12-28 00:25:33,046 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:33,047 INFO L82 PathProgramCache]: Analyzing trace with hash -541236016, now seen corresponding path program 1 times [2019-12-28 00:25:33,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:33,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706954632] [2019-12-28 00:25:33,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:33,127 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-28 00:25:33,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706954632] [2019-12-28 00:25:33,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:33,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:25:33,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1399439225] [2019-12-28 00:25:33,128 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:33,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:33,144 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-28 00:25:33,145 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:33,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:33,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:25:33,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:33,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:25:33,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:25:33,146 INFO L87 Difference]: Start difference. First operand 53409 states and 187040 transitions. Second operand 6 states. [2019-12-28 00:25:33,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:33,919 INFO L93 Difference]: Finished difference Result 68649 states and 237304 transitions. [2019-12-28 00:25:33,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 00:25:33,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-28 00:25:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:34,063 INFO L225 Difference]: With dead ends: 68649 [2019-12-28 00:25:34,063 INFO L226 Difference]: Without dead ends: 68081 [2019-12-28 00:25:34,063 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-28 00:25:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68081 states. [2019-12-28 00:25:37,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68081 to 53493. [2019-12-28 00:25:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53493 states. [2019-12-28 00:25:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53493 states to 53493 states and 187737 transitions. [2019-12-28 00:25:37,474 INFO L78 Accepts]: Start accepts. Automaton has 53493 states and 187737 transitions. Word has length 56 [2019-12-28 00:25:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:37,474 INFO L462 AbstractCegarLoop]: Abstraction has 53493 states and 187737 transitions. [2019-12-28 00:25:37,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:25:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 53493 states and 187737 transitions. [2019-12-28 00:25:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 00:25:37,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:37,485 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] [2019-12-28 00:25:37,485 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:37,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:37,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1873901397, now seen corresponding path program 1 times [2019-12-28 00:25:37,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:37,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268225439] [2019-12-28 00:25:37,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:37,600 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-28 00:25:37,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268225439] [2019-12-28 00:25:37,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:37,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:25:37,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [636960949] [2019-12-28 00:25:37,601 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:37,608 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:37,614 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-28 00:25:37,614 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:37,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:37,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:25:37,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:37,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:25:37,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:25:37,616 INFO L87 Difference]: Start difference. First operand 53493 states and 187737 transitions. Second operand 5 states. [2019-12-28 00:25:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:38,244 INFO L93 Difference]: Finished difference Result 53613 states and 187581 transitions. [2019-12-28 00:25:38,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:25:38,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-28 00:25:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:38,373 INFO L225 Difference]: With dead ends: 53613 [2019-12-28 00:25:38,374 INFO L226 Difference]: Without dead ends: 53613 [2019-12-28 00:25:38,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:25:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53613 states. [2019-12-28 00:25:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53613 to 53526. [2019-12-28 00:25:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53526 states. [2019-12-28 00:25:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53526 states to 53526 states and 187311 transitions. [2019-12-28 00:25:39,934 INFO L78 Accepts]: Start accepts. Automaton has 53526 states and 187311 transitions. Word has length 57 [2019-12-28 00:25:39,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:39,934 INFO L462 AbstractCegarLoop]: Abstraction has 53526 states and 187311 transitions. [2019-12-28 00:25:39,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:25:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 53526 states and 187311 transitions. [2019-12-28 00:25:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 00:25:39,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:39,946 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] [2019-12-28 00:25:39,946 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:39,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:39,946 INFO L82 PathProgramCache]: Analyzing trace with hash -986397716, now seen corresponding path program 1 times [2019-12-28 00:25:39,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:39,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792987060] [2019-12-28 00:25:39,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:40,031 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-28 00:25:40,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792987060] [2019-12-28 00:25:40,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:40,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:25:40,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1813160613] [2019-12-28 00:25:40,032 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:40,040 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:40,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-28 00:25:40,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:40,046 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:40,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:25:40,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:40,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:25:40,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:25:40,047 INFO L87 Difference]: Start difference. First operand 53526 states and 187311 transitions. Second operand 4 states. [2019-12-28 00:25:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:40,107 INFO L93 Difference]: Finished difference Result 10215 states and 31231 transitions. [2019-12-28 00:25:40,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:25:40,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-28 00:25:40,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:40,121 INFO L225 Difference]: With dead ends: 10215 [2019-12-28 00:25:40,121 INFO L226 Difference]: Without dead ends: 8510 [2019-12-28 00:25:40,121 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-28 00:25:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8510 states. [2019-12-28 00:25:40,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8510 to 8462. [2019-12-28 00:25:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8462 states. [2019-12-28 00:25:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8462 states to 8462 states and 25310 transitions. [2019-12-28 00:25:40,231 INFO L78 Accepts]: Start accepts. Automaton has 8462 states and 25310 transitions. Word has length 57 [2019-12-28 00:25:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:40,232 INFO L462 AbstractCegarLoop]: Abstraction has 8462 states and 25310 transitions. [2019-12-28 00:25:40,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:25:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 8462 states and 25310 transitions. [2019-12-28 00:25:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 00:25:40,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:40,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:25:40,235 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:40,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:40,236 INFO L82 PathProgramCache]: Analyzing trace with hash 227053228, now seen corresponding path program 1 times [2019-12-28 00:25:40,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:40,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233464103] [2019-12-28 00:25:40,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:40,287 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-28 00:25:40,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233464103] [2019-12-28 00:25:40,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:40,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:25:40,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1709305735] [2019-12-28 00:25:40,288 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:40,298 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:40,309 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 64 transitions. [2019-12-28 00:25:40,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:40,309 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:40,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:25:40,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:40,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:25:40,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:25:40,310 INFO L87 Difference]: Start difference. First operand 8462 states and 25310 transitions. Second operand 4 states. [2019-12-28 00:25:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:40,422 INFO L93 Difference]: Finished difference Result 9709 states and 29089 transitions. [2019-12-28 00:25:40,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:25:40,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-28 00:25:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:40,441 INFO L225 Difference]: With dead ends: 9709 [2019-12-28 00:25:40,441 INFO L226 Difference]: Without dead ends: 9709 [2019-12-28 00:25:40,442 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-28 00:25:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9709 states. [2019-12-28 00:25:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9709 to 8882. [2019-12-28 00:25:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8882 states. [2019-12-28 00:25:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8882 states to 8882 states and 26573 transitions. [2019-12-28 00:25:40,636 INFO L78 Accepts]: Start accepts. Automaton has 8882 states and 26573 transitions. Word has length 64 [2019-12-28 00:25:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:40,637 INFO L462 AbstractCegarLoop]: Abstraction has 8882 states and 26573 transitions. [2019-12-28 00:25:40,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:25:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 8882 states and 26573 transitions. [2019-12-28 00:25:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 00:25:40,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:40,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:25:40,642 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:40,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:40,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1969863563, now seen corresponding path program 1 times [2019-12-28 00:25:40,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:40,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279345705] [2019-12-28 00:25:40,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:25:40,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279345705] [2019-12-28 00:25:40,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:40,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:25:40,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1647228630] [2019-12-28 00:25:40,707 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:40,717 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:40,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 64 transitions. [2019-12-28 00:25:40,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:40,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:40,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:25:40,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:40,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:25:40,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:25:40,730 INFO L87 Difference]: Start difference. First operand 8882 states and 26573 transitions. Second operand 6 states. [2019-12-28 00:25:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:41,147 INFO L93 Difference]: Finished difference Result 11198 states and 33042 transitions. [2019-12-28 00:25:41,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 00:25:41,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-28 00:25:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:41,163 INFO L225 Difference]: With dead ends: 11198 [2019-12-28 00:25:41,163 INFO L226 Difference]: Without dead ends: 11137 [2019-12-28 00:25:41,164 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-28 00:25:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11137 states. [2019-12-28 00:25:41,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11137 to 10413. [2019-12-28 00:25:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10413 states. [2019-12-28 00:25:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10413 states to 10413 states and 30918 transitions. [2019-12-28 00:25:41,302 INFO L78 Accepts]: Start accepts. Automaton has 10413 states and 30918 transitions. Word has length 64 [2019-12-28 00:25:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:41,302 INFO L462 AbstractCegarLoop]: Abstraction has 10413 states and 30918 transitions. [2019-12-28 00:25:41,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:25:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 10413 states and 30918 transitions. [2019-12-28 00:25:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 00:25:41,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:41,308 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] [2019-12-28 00:25:41,308 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:41,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:41,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1630047156, now seen corresponding path program 1 times [2019-12-28 00:25:41,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:41,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424931505] [2019-12-28 00:25:41,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:41,379 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-28 00:25:41,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424931505] [2019-12-28 00:25:41,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:41,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:25:41,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [541943640] [2019-12-28 00:25:41,380 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:41,392 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:41,417 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 174 transitions. [2019-12-28 00:25:41,418 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:41,509 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:25:41,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:25:41,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:41,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:25:41,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:25:41,510 INFO L87 Difference]: Start difference. First operand 10413 states and 30918 transitions. Second operand 6 states. [2019-12-28 00:25:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:42,358 INFO L93 Difference]: Finished difference Result 23564 states and 70323 transitions. [2019-12-28 00:25:42,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 00:25:42,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-28 00:25:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:42,470 INFO L225 Difference]: With dead ends: 23564 [2019-12-28 00:25:42,470 INFO L226 Difference]: Without dead ends: 23564 [2019-12-28 00:25:42,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:25:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23564 states. [2019-12-28 00:25:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23564 to 12623. [2019-12-28 00:25:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12623 states. [2019-12-28 00:25:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12623 states to 12623 states and 37510 transitions. [2019-12-28 00:25:43,268 INFO L78 Accepts]: Start accepts. Automaton has 12623 states and 37510 transitions. Word has length 70 [2019-12-28 00:25:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:43,269 INFO L462 AbstractCegarLoop]: Abstraction has 12623 states and 37510 transitions. [2019-12-28 00:25:43,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:25:43,269 INFO L276 IsEmpty]: Start isEmpty. Operand 12623 states and 37510 transitions. [2019-12-28 00:25:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 00:25:43,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:43,280 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] [2019-12-28 00:25:43,280 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:43,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:43,281 INFO L82 PathProgramCache]: Analyzing trace with hash -166904203, now seen corresponding path program 1 times [2019-12-28 00:25:43,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:43,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186114467] [2019-12-28 00:25:43,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:43,364 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-28 00:25:43,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186114467] [2019-12-28 00:25:43,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:43,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:25:43,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [699456428] [2019-12-28 00:25:43,365 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:43,377 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:43,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 174 transitions. [2019-12-28 00:25:43,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:43,450 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 00:25:43,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:25:43,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:43,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:25:43,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:25:43,451 INFO L87 Difference]: Start difference. First operand 12623 states and 37510 transitions. Second operand 7 states. [2019-12-28 00:25:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:43,887 INFO L93 Difference]: Finished difference Result 16661 states and 48900 transitions. [2019-12-28 00:25:43,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:25:43,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-28 00:25:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:43,914 INFO L225 Difference]: With dead ends: 16661 [2019-12-28 00:25:43,914 INFO L226 Difference]: Without dead ends: 16661 [2019-12-28 00:25:43,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:25:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16661 states. [2019-12-28 00:25:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16661 to 14390. [2019-12-28 00:25:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14390 states. [2019-12-28 00:25:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14390 states to 14390 states and 42416 transitions. [2019-12-28 00:25:44,217 INFO L78 Accepts]: Start accepts. Automaton has 14390 states and 42416 transitions. Word has length 70 [2019-12-28 00:25:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:44,218 INFO L462 AbstractCegarLoop]: Abstraction has 14390 states and 42416 transitions. [2019-12-28 00:25:44,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:25:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 14390 states and 42416 transitions. [2019-12-28 00:25:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 00:25:44,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:44,231 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] [2019-12-28 00:25:44,231 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:44,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1077860278, now seen corresponding path program 1 times [2019-12-28 00:25:44,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:44,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901281387] [2019-12-28 00:25:44,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:44,329 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-28 00:25:44,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901281387] [2019-12-28 00:25:44,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:44,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:25:44,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [156592742] [2019-12-28 00:25:44,330 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:44,342 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:44,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 174 transitions. [2019-12-28 00:25:44,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:44,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 00:25:44,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 00:25:44,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:44,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 00:25:44,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:25:44,524 INFO L87 Difference]: Start difference. First operand 14390 states and 42416 transitions. Second operand 9 states. [2019-12-28 00:25:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:45,495 INFO L93 Difference]: Finished difference Result 15631 states and 45417 transitions. [2019-12-28 00:25:45,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:25:45,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-12-28 00:25:45,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:45,517 INFO L225 Difference]: With dead ends: 15631 [2019-12-28 00:25:45,517 INFO L226 Difference]: Without dead ends: 15631 [2019-12-28 00:25:45,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:25:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15631 states. [2019-12-28 00:25:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15631 to 15301. [2019-12-28 00:25:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15301 states. [2019-12-28 00:25:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15301 states to 15301 states and 44579 transitions. [2019-12-28 00:25:45,805 INFO L78 Accepts]: Start accepts. Automaton has 15301 states and 44579 transitions. Word has length 70 [2019-12-28 00:25:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:45,805 INFO L462 AbstractCegarLoop]: Abstraction has 15301 states and 44579 transitions. [2019-12-28 00:25:45,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 00:25:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 15301 states and 44579 transitions. [2019-12-28 00:25:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 00:25:45,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:45,816 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] [2019-12-28 00:25:45,816 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:45,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:45,816 INFO L82 PathProgramCache]: Analyzing trace with hash -999349065, now seen corresponding path program 1 times [2019-12-28 00:25:45,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:45,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264870238] [2019-12-28 00:25:45,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:45,904 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-28 00:25:45,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264870238] [2019-12-28 00:25:45,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:45,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:25:45,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1147524823] [2019-12-28 00:25:45,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:45,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:45,946 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 174 transitions. [2019-12-28 00:25:45,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:46,068 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 00:25:46,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 00:25:46,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:46,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 00:25:46,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:25:46,069 INFO L87 Difference]: Start difference. First operand 15301 states and 44579 transitions. Second operand 10 states. [2019-12-28 00:25:46,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:46,677 INFO L93 Difference]: Finished difference Result 17459 states and 49461 transitions. [2019-12-28 00:25:46,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 00:25:46,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2019-12-28 00:25:46,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:46,700 INFO L225 Difference]: With dead ends: 17459 [2019-12-28 00:25:46,700 INFO L226 Difference]: Without dead ends: 17459 [2019-12-28 00:25:46,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-28 00:25:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17459 states. [2019-12-28 00:25:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17459 to 15842. [2019-12-28 00:25:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15842 states. [2019-12-28 00:25:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15842 states to 15842 states and 45416 transitions. [2019-12-28 00:25:46,914 INFO L78 Accepts]: Start accepts. Automaton has 15842 states and 45416 transitions. Word has length 70 [2019-12-28 00:25:46,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:46,914 INFO L462 AbstractCegarLoop]: Abstraction has 15842 states and 45416 transitions. [2019-12-28 00:25:46,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 00:25:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 15842 states and 45416 transitions. [2019-12-28 00:25:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 00:25:46,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:46,923 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] [2019-12-28 00:25:46,923 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:46,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:46,923 INFO L82 PathProgramCache]: Analyzing trace with hash -787998152, now seen corresponding path program 1 times [2019-12-28 00:25:46,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:46,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103380366] [2019-12-28 00:25:46,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:47,062 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-28 00:25:47,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103380366] [2019-12-28 00:25:47,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:47,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:25:47,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1990978828] [2019-12-28 00:25:47,064 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:47,076 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:47,351 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 174 transitions. [2019-12-28 00:25:47,351 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:47,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 00:25:47,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 00:25:47,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:47,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 00:25:47,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:25:47,460 INFO L87 Difference]: Start difference. First operand 15842 states and 45416 transitions. Second operand 10 states. [2019-12-28 00:25:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:48,304 INFO L93 Difference]: Finished difference Result 18414 states and 51438 transitions. [2019-12-28 00:25:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 00:25:48,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2019-12-28 00:25:48,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:48,329 INFO L225 Difference]: With dead ends: 18414 [2019-12-28 00:25:48,329 INFO L226 Difference]: Without dead ends: 18414 [2019-12-28 00:25:48,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-12-28 00:25:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18414 states. [2019-12-28 00:25:48,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18414 to 16245. [2019-12-28 00:25:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16245 states. [2019-12-28 00:25:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16245 states to 16245 states and 45209 transitions. [2019-12-28 00:25:48,534 INFO L78 Accepts]: Start accepts. Automaton has 16245 states and 45209 transitions. Word has length 70 [2019-12-28 00:25:48,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:48,534 INFO L462 AbstractCegarLoop]: Abstraction has 16245 states and 45209 transitions. [2019-12-28 00:25:48,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 00:25:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 16245 states and 45209 transitions. [2019-12-28 00:25:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 00:25:48,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:48,541 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] [2019-12-28 00:25:48,541 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:48,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:48,541 INFO L82 PathProgramCache]: Analyzing trace with hash 99505529, now seen corresponding path program 1 times [2019-12-28 00:25:48,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:48,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430091997] [2019-12-28 00:25:48,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:48,612 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-28 00:25:48,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430091997] [2019-12-28 00:25:48,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:48,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:25:48,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1844045985] [2019-12-28 00:25:48,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:48,623 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:48,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 174 transitions. [2019-12-28 00:25:48,648 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:48,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:25:48,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:25:48,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:48,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:25:48,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:25:48,664 INFO L87 Difference]: Start difference. First operand 16245 states and 45209 transitions. Second operand 6 states. [2019-12-28 00:25:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:48,734 INFO L93 Difference]: Finished difference Result 5337 states and 12605 transitions. [2019-12-28 00:25:48,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:25:48,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-28 00:25:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:48,741 INFO L225 Difference]: With dead ends: 5337 [2019-12-28 00:25:48,741 INFO L226 Difference]: Without dead ends: 4650 [2019-12-28 00:25:48,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:25:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2019-12-28 00:25:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4325. [2019-12-28 00:25:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4325 states. [2019-12-28 00:25:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 9952 transitions. [2019-12-28 00:25:48,805 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 9952 transitions. Word has length 70 [2019-12-28 00:25:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:48,805 INFO L462 AbstractCegarLoop]: Abstraction has 4325 states and 9952 transitions. [2019-12-28 00:25:48,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:25:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 9952 transitions. [2019-12-28 00:25:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 00:25:48,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:48,810 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] [2019-12-28 00:25:48,811 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:48,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:48,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1027808388, now seen corresponding path program 1 times [2019-12-28 00:25:48,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:48,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778148888] [2019-12-28 00:25:48,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:48,840 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-28 00:25:48,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778148888] [2019-12-28 00:25:48,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:48,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:25:48,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [394382499] [2019-12-28 00:25:48,841 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:48,852 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:48,868 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 70 transitions. [2019-12-28 00:25:48,868 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:48,868 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:48,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:25:48,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:48,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:25:48,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:25:48,870 INFO L87 Difference]: Start difference. First operand 4325 states and 9952 transitions. Second operand 3 states. [2019-12-28 00:25:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:48,908 INFO L93 Difference]: Finished difference Result 5345 states and 12117 transitions. [2019-12-28 00:25:48,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:25:48,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-28 00:25:48,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:48,914 INFO L225 Difference]: With dead ends: 5345 [2019-12-28 00:25:48,915 INFO L226 Difference]: Without dead ends: 5345 [2019-12-28 00:25:48,915 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-28 00:25:48,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2019-12-28 00:25:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 4260. [2019-12-28 00:25:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4260 states. [2019-12-28 00:25:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 9560 transitions. [2019-12-28 00:25:48,959 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 9560 transitions. Word has length 70 [2019-12-28 00:25:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:48,959 INFO L462 AbstractCegarLoop]: Abstraction has 4260 states and 9560 transitions. [2019-12-28 00:25:48,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:25:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 9560 transitions. [2019-12-28 00:25:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-28 00:25:48,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:48,963 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] [2019-12-28 00:25:48,963 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:48,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:48,963 INFO L82 PathProgramCache]: Analyzing trace with hash -812209841, now seen corresponding path program 1 times [2019-12-28 00:25:48,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:48,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842262447] [2019-12-28 00:25:48,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:49,021 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-28 00:25:49,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842262447] [2019-12-28 00:25:49,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:49,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:25:49,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2071520816] [2019-12-28 00:25:49,022 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:49,036 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:49,056 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 76 transitions. [2019-12-28 00:25:49,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:49,057 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:49,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:25:49,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:49,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:25:49,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:25:49,058 INFO L87 Difference]: Start difference. First operand 4260 states and 9560 transitions. Second operand 5 states. [2019-12-28 00:25:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:49,241 INFO L93 Difference]: Finished difference Result 5299 states and 11944 transitions. [2019-12-28 00:25:49,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 00:25:49,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-12-28 00:25:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:49,247 INFO L225 Difference]: With dead ends: 5299 [2019-12-28 00:25:49,247 INFO L226 Difference]: Without dead ends: 5299 [2019-12-28 00:25:49,248 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-28 00:25:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2019-12-28 00:25:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 4888. [2019-12-28 00:25:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2019-12-28 00:25:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10968 transitions. [2019-12-28 00:25:49,295 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10968 transitions. Word has length 76 [2019-12-28 00:25:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:49,295 INFO L462 AbstractCegarLoop]: Abstraction has 4888 states and 10968 transitions. [2019-12-28 00:25:49,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:25:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10968 transitions. [2019-12-28 00:25:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-28 00:25:49,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:49,299 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] [2019-12-28 00:25:49,299 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:49,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:49,299 INFO L82 PathProgramCache]: Analyzing trace with hash 930600494, now seen corresponding path program 1 times [2019-12-28 00:25:49,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:49,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427422428] [2019-12-28 00:25:49,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:49,384 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-28 00:25:49,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427422428] [2019-12-28 00:25:49,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:49,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:25:49,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [956441058] [2019-12-28 00:25:49,387 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:49,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:49,426 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 76 transitions. [2019-12-28 00:25:49,427 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:49,427 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:49,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:25:49,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:49,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:25:49,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:25:49,429 INFO L87 Difference]: Start difference. First operand 4888 states and 10968 transitions. Second operand 7 states. [2019-12-28 00:25:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:49,899 INFO L93 Difference]: Finished difference Result 5520 states and 12289 transitions. [2019-12-28 00:25:49,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 00:25:49,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-12-28 00:25:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:49,907 INFO L225 Difference]: With dead ends: 5520 [2019-12-28 00:25:49,907 INFO L226 Difference]: Without dead ends: 5467 [2019-12-28 00:25:49,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 00:25:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2019-12-28 00:25:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 4912. [2019-12-28 00:25:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4912 states. [2019-12-28 00:25:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 10945 transitions. [2019-12-28 00:25:49,955 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 10945 transitions. Word has length 76 [2019-12-28 00:25:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:49,955 INFO L462 AbstractCegarLoop]: Abstraction has 4912 states and 10945 transitions. [2019-12-28 00:25:49,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:25:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 10945 transitions. [2019-12-28 00:25:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 00:25:49,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:49,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:25:49,960 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:49,960 INFO L82 PathProgramCache]: Analyzing trace with hash 513999619, now seen corresponding path program 1 times [2019-12-28 00:25:49,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:49,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832835873] [2019-12-28 00:25:49,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:50,033 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-28 00:25:50,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832835873] [2019-12-28 00:25:50,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:50,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:25:50,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1926155523] [2019-12-28 00:25:50,035 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:50,060 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:50,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 169 states and 238 transitions. [2019-12-28 00:25:50,134 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:50,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 00:25:50,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:25:50,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:50,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:25:50,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:25:50,187 INFO L87 Difference]: Start difference. First operand 4912 states and 10945 transitions. Second operand 8 states. [2019-12-28 00:25:50,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:50,811 INFO L93 Difference]: Finished difference Result 7267 states and 15853 transitions. [2019-12-28 00:25:50,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:25:50,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-28 00:25:50,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:50,819 INFO L225 Difference]: With dead ends: 7267 [2019-12-28 00:25:50,819 INFO L226 Difference]: Without dead ends: 7267 [2019-12-28 00:25:50,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:25:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7267 states. [2019-12-28 00:25:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7267 to 5532. [2019-12-28 00:25:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5532 states. [2019-12-28 00:25:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 12245 transitions. [2019-12-28 00:25:50,877 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 12245 transitions. Word has length 97 [2019-12-28 00:25:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:50,877 INFO L462 AbstractCegarLoop]: Abstraction has 5532 states and 12245 transitions. [2019-12-28 00:25:50,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:25:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 12245 transitions. [2019-12-28 00:25:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-28 00:25:50,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:50,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, 1, 1, 1] [2019-12-28 00:25:50,882 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:50,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1028011755, now seen corresponding path program 1 times [2019-12-28 00:25:50,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:50,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073348237] [2019-12-28 00:25:50,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:50,969 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-28 00:25:50,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073348237] [2019-12-28 00:25:50,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:50,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:25:50,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1921037673] [2019-12-28 00:25:50,970 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:50,997 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:51,082 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 269 transitions. [2019-12-28 00:25:51,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:51,168 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 00:25:51,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 00:25:51,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:51,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 00:25:51,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:25:51,169 INFO L87 Difference]: Start difference. First operand 5532 states and 12245 transitions. Second operand 11 states. [2019-12-28 00:25:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:55,142 INFO L93 Difference]: Finished difference Result 13251 states and 29568 transitions. [2019-12-28 00:25:55,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-28 00:25:55,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-12-28 00:25:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:55,157 INFO L225 Difference]: With dead ends: 13251 [2019-12-28 00:25:55,157 INFO L226 Difference]: Without dead ends: 13139 [2019-12-28 00:25:55,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=539, Invalid=1441, Unknown=0, NotChecked=0, Total=1980 [2019-12-28 00:25:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13139 states. [2019-12-28 00:25:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13139 to 7322. [2019-12-28 00:25:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7322 states. [2019-12-28 00:25:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7322 states to 7322 states and 16431 transitions. [2019-12-28 00:25:55,274 INFO L78 Accepts]: Start accepts. Automaton has 7322 states and 16431 transitions. Word has length 99 [2019-12-28 00:25:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:55,275 INFO L462 AbstractCegarLoop]: Abstraction has 7322 states and 16431 transitions. [2019-12-28 00:25:55,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 00:25:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 7322 states and 16431 transitions. [2019-12-28 00:25:55,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-28 00:25:55,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:55,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:25:55,283 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:55,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:55,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1016695628, now seen corresponding path program 1 times [2019-12-28 00:25:55,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:55,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935874058] [2019-12-28 00:25:55,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:55,382 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-28 00:25:55,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935874058] [2019-12-28 00:25:55,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:55,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:25:55,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66057747] [2019-12-28 00:25:55,383 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:55,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:55,534 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 268 transitions. [2019-12-28 00:25:55,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:55,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 00:25:55,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 00:25:55,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:55,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 00:25:55,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:25:55,587 INFO L87 Difference]: Start difference. First operand 7322 states and 16431 transitions. Second operand 10 states. [2019-12-28 00:25:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:58,637 INFO L93 Difference]: Finished difference Result 12837 states and 28589 transitions. [2019-12-28 00:25:58,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-28 00:25:58,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2019-12-28 00:25:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:58,651 INFO L225 Difference]: With dead ends: 12837 [2019-12-28 00:25:58,652 INFO L226 Difference]: Without dead ends: 12732 [2019-12-28 00:25:58,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=500, Invalid=1570, Unknown=0, NotChecked=0, Total=2070 [2019-12-28 00:25:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12732 states. [2019-12-28 00:25:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12732 to 7928. [2019-12-28 00:25:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7928 states. [2019-12-28 00:25:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7928 states to 7928 states and 17671 transitions. [2019-12-28 00:25:58,774 INFO L78 Accepts]: Start accepts. Automaton has 7928 states and 17671 transitions. Word has length 99 [2019-12-28 00:25:58,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:58,774 INFO L462 AbstractCegarLoop]: Abstraction has 7928 states and 17671 transitions. [2019-12-28 00:25:58,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 00:25:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 7928 states and 17671 transitions. [2019-12-28 00:25:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-28 00:25:58,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:58,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:25:58,784 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:58,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:58,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1201062325, now seen corresponding path program 1 times [2019-12-28 00:25:58,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:58,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675049891] [2019-12-28 00:25:58,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:58,894 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-28 00:25:58,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675049891] [2019-12-28 00:25:58,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:58,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:25:58,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [119864200] [2019-12-28 00:25:58,895 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:58,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:59,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 268 transitions. [2019-12-28 00:25:59,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:59,102 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 00:25:59,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 00:25:59,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:59,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 00:25:59,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:25:59,104 INFO L87 Difference]: Start difference. First operand 7928 states and 17671 transitions. Second operand 9 states. [2019-12-28 00:25:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:59,821 INFO L93 Difference]: Finished difference Result 7457 states and 16140 transitions. [2019-12-28 00:25:59,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 00:25:59,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-12-28 00:25:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:59,834 INFO L225 Difference]: With dead ends: 7457 [2019-12-28 00:25:59,834 INFO L226 Difference]: Without dead ends: 7419 [2019-12-28 00:25:59,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-12-28 00:25:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states. [2019-12-28 00:25:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 5656. [2019-12-28 00:25:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5656 states. [2019-12-28 00:25:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 12411 transitions. [2019-12-28 00:25:59,975 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 12411 transitions. Word has length 99 [2019-12-28 00:25:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:25:59,976 INFO L462 AbstractCegarLoop]: Abstraction has 5656 states and 12411 transitions. [2019-12-28 00:25:59,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 00:25:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 12411 transitions. [2019-12-28 00:25:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-28 00:25:59,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:59,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:25:59,986 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:59,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:59,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1192417937, now seen corresponding path program 1 times [2019-12-28 00:25:59,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:59,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742969876] [2019-12-28 00:25:59,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:26:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:26:00,101 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-28 00:26:00,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742969876] [2019-12-28 00:26:00,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:26:00,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:26:00,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1466760008] [2019-12-28 00:26:00,103 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:26:00,148 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:26:00,294 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 233 transitions. [2019-12-28 00:26:00,294 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:26:00,332 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:26:00,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:26:00,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:26:00,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:26:00,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:26:00,334 INFO L87 Difference]: Start difference. First operand 5656 states and 12411 transitions. Second operand 7 states. [2019-12-28 00:26:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:26:00,813 INFO L93 Difference]: Finished difference Result 8829 states and 19161 transitions. [2019-12-28 00:26:00,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 00:26:00,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-12-28 00:26:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:26:00,825 INFO L225 Difference]: With dead ends: 8829 [2019-12-28 00:26:00,825 INFO L226 Difference]: Without dead ends: 8829 [2019-12-28 00:26:00,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-28 00:26:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8829 states. [2019-12-28 00:26:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8829 to 4984. [2019-12-28 00:26:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4984 states. [2019-12-28 00:26:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 10931 transitions. [2019-12-28 00:26:00,926 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 10931 transitions. Word has length 99 [2019-12-28 00:26:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:26:00,927 INFO L462 AbstractCegarLoop]: Abstraction has 4984 states and 10931 transitions. [2019-12-28 00:26:00,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:26:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 10931 transitions. [2019-12-28 00:26:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-28 00:26:00,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:26:00,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:26:00,934 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:26:00,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:26:00,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2077057360, now seen corresponding path program 1 times [2019-12-28 00:26:00,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:26:00,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370380074] [2019-12-28 00:26:00,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:26:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:26:01,024 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-28 00:26:01,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370380074] [2019-12-28 00:26:01,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:26:01,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:26:01,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1173719411] [2019-12-28 00:26:01,025 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:26:01,053 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:26:01,147 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 232 transitions. [2019-12-28 00:26:01,147 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:26:01,233 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 00:26:01,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 00:26:01,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:26:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 00:26:01,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:26:01,234 INFO L87 Difference]: Start difference. First operand 4984 states and 10931 transitions. Second operand 9 states. [2019-12-28 00:26:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:26:03,795 INFO L93 Difference]: Finished difference Result 9186 states and 19875 transitions. [2019-12-28 00:26:03,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-28 00:26:03,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-12-28 00:26:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:26:03,806 INFO L225 Difference]: With dead ends: 9186 [2019-12-28 00:26:03,806 INFO L226 Difference]: Without dead ends: 9092 [2019-12-28 00:26:03,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2019-12-28 00:26:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9092 states. [2019-12-28 00:26:03,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9092 to 5681. [2019-12-28 00:26:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5681 states. [2019-12-28 00:26:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5681 states to 5681 states and 12465 transitions. [2019-12-28 00:26:03,884 INFO L78 Accepts]: Start accepts. Automaton has 5681 states and 12465 transitions. Word has length 99 [2019-12-28 00:26:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:26:03,885 INFO L462 AbstractCegarLoop]: Abstraction has 5681 states and 12465 transitions. [2019-12-28 00:26:03,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 00:26:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 5681 states and 12465 transitions. [2019-12-28 00:26:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-28 00:26:03,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:26:03,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:26:03,890 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:26:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:26:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1963173391, now seen corresponding path program 1 times [2019-12-28 00:26:03,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:26:03,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2433043] [2019-12-28 00:26:03,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:26:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:26:03,960 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-28 00:26:03,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2433043] [2019-12-28 00:26:03,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:26:03,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:26:03,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [349596283] [2019-12-28 00:26:03,961 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:26:03,987 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:26:04,094 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 232 transitions. [2019-12-28 00:26:04,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:26:04,114 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:26:04,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:26:04,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:26:04,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:26:04,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:26:04,115 INFO L87 Difference]: Start difference. First operand 5681 states and 12465 transitions. Second operand 7 states. [2019-12-28 00:26:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:26:04,666 INFO L93 Difference]: Finished difference Result 9330 states and 20359 transitions. [2019-12-28 00:26:04,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 00:26:04,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-12-28 00:26:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:26:04,677 INFO L225 Difference]: With dead ends: 9330 [2019-12-28 00:26:04,677 INFO L226 Difference]: Without dead ends: 9204 [2019-12-28 00:26:04,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-12-28 00:26:04,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9204 states. [2019-12-28 00:26:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9204 to 5421. [2019-12-28 00:26:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-28 00:26:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 11937 transitions. [2019-12-28 00:26:04,757 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 11937 transitions. Word has length 99 [2019-12-28 00:26:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:26:04,757 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 11937 transitions. [2019-12-28 00:26:04,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:26:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 11937 transitions. [2019-12-28 00:26:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-28 00:26:04,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:26:04,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:26:04,763 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:26:04,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:26:04,763 INFO L82 PathProgramCache]: Analyzing trace with hash 579065745, now seen corresponding path program 2 times [2019-12-28 00:26:04,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:26:04,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388726367] [2019-12-28 00:26:04,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:26:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:26:04,869 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-28 00:26:04,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388726367] [2019-12-28 00:26:04,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:26:04,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:26:04,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [477818438] [2019-12-28 00:26:04,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:26:04,889 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:26:05,027 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 232 transitions. [2019-12-28 00:26:05,027 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:26:05,102 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 00:26:05,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 00:26:05,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:26:05,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 00:26:05,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:26:05,103 INFO L87 Difference]: Start difference. First operand 5421 states and 11937 transitions. Second operand 10 states. [2019-12-28 00:26:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:26:05,644 INFO L93 Difference]: Finished difference Result 6470 states and 14059 transitions. [2019-12-28 00:26:05,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 00:26:05,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2019-12-28 00:26:05,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:26:05,653 INFO L225 Difference]: With dead ends: 6470 [2019-12-28 00:26:05,653 INFO L226 Difference]: Without dead ends: 6470 [2019-12-28 00:26:05,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-12-28 00:26:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6470 states. [2019-12-28 00:26:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6470 to 5363. [2019-12-28 00:26:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5363 states. [2019-12-28 00:26:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5363 states to 5363 states and 11811 transitions. [2019-12-28 00:26:05,745 INFO L78 Accepts]: Start accepts. Automaton has 5363 states and 11811 transitions. Word has length 99 [2019-12-28 00:26:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:26:05,746 INFO L462 AbstractCegarLoop]: Abstraction has 5363 states and 11811 transitions. [2019-12-28 00:26:05,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 00:26:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 5363 states and 11811 transitions. [2019-12-28 00:26:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-28 00:26:05,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:26:05,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:26:05,753 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:26:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:26:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1461100972, now seen corresponding path program 1 times [2019-12-28 00:26:05,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:26:05,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705100672] [2019-12-28 00:26:05,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:26:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:26:05,916 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-28 00:26:05,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705100672] [2019-12-28 00:26:05,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:26:05,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 00:26:05,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [215051913] [2019-12-28 00:26:05,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:26:05,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:26:06,081 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 268 transitions. [2019-12-28 00:26:06,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:26:06,227 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 00:26:06,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 00:26:06,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:26:06,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 00:26:06,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-28 00:26:06,232 INFO L87 Difference]: Start difference. First operand 5363 states and 11811 transitions. Second operand 13 states. [2019-12-28 00:26:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:26:08,793 INFO L93 Difference]: Finished difference Result 9332 states and 20449 transitions. [2019-12-28 00:26:08,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-28 00:26:08,794 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2019-12-28 00:26:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:26:08,806 INFO L225 Difference]: With dead ends: 9332 [2019-12-28 00:26:08,806 INFO L226 Difference]: Without dead ends: 9332 [2019-12-28 00:26:08,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=483, Invalid=1409, Unknown=0, NotChecked=0, Total=1892 [2019-12-28 00:26:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9332 states. [2019-12-28 00:26:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9332 to 5688. [2019-12-28 00:26:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5688 states. [2019-12-28 00:26:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5688 states to 5688 states and 12461 transitions. [2019-12-28 00:26:09,066 INFO L78 Accepts]: Start accepts. Automaton has 5688 states and 12461 transitions. Word has length 99 [2019-12-28 00:26:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:26:09,066 INFO L462 AbstractCegarLoop]: Abstraction has 5688 states and 12461 transitions. [2019-12-28 00:26:09,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 00:26:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 5688 states and 12461 transitions. [2019-12-28 00:26:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-28 00:26:09,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:26:09,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:26:09,072 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:26:09,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:26:09,073 INFO L82 PathProgramCache]: Analyzing trace with hash -573597291, now seen corresponding path program 1 times [2019-12-28 00:26:09,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:26:09,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755517355] [2019-12-28 00:26:09,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:26:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:26:09,282 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-28 00:26:09,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755517355] [2019-12-28 00:26:09,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:26:09,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 00:26:09,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1208089906] [2019-12-28 00:26:09,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:26:09,316 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:26:09,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 268 transitions. [2019-12-28 00:26:09,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:26:09,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 00:26:09,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 00:26:09,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:26:09,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 00:26:09,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:26:09,527 INFO L87 Difference]: Start difference. First operand 5688 states and 12461 transitions. Second operand 10 states. [2019-12-28 00:26:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:26:10,133 INFO L93 Difference]: Finished difference Result 11759 states and 25763 transitions. [2019-12-28 00:26:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 00:26:10,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2019-12-28 00:26:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:26:10,144 INFO L225 Difference]: With dead ends: 11759 [2019-12-28 00:26:10,145 INFO L226 Difference]: Without dead ends: 6223 [2019-12-28 00:26:10,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-12-28 00:26:10,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6223 states. [2019-12-28 00:26:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6223 to 3754. [2019-12-28 00:26:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2019-12-28 00:26:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 8331 transitions. [2019-12-28 00:26:10,237 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 8331 transitions. Word has length 99 [2019-12-28 00:26:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:26:10,238 INFO L462 AbstractCegarLoop]: Abstraction has 3754 states and 8331 transitions. [2019-12-28 00:26:10,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 00:26:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 8331 transitions. [2019-12-28 00:26:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-28 00:26:10,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:26:10,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:26:10,245 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:26:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:26:10,246 INFO L82 PathProgramCache]: Analyzing trace with hash 790630937, now seen corresponding path program 2 times [2019-12-28 00:26:10,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:26:10,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225503127] [2019-12-28 00:26:10,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:26:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 00:26:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 00:26:10,376 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 00:26:10,376 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 00:26:10,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 12:26:10 BasicIcfg [2019-12-28 00:26:10,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 00:26:10,573 INFO L168 Benchmark]: Toolchain (without parser) took 69824.91 ms. Allocated memory was 138.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 100.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-28 00:26:10,574 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-28 00:26:10,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.29 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.4 MB in the beginning and 158.3 MB in the end (delta: -57.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-28 00:26:10,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.86 ms. Allocated memory is still 203.9 MB. Free memory was 158.3 MB in the beginning and 155.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 00:26:10,576 INFO L168 Benchmark]: Boogie Preprocessor took 37.19 ms. Allocated memory is still 203.9 MB. Free memory was 155.6 MB in the beginning and 153.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 00:26:10,576 INFO L168 Benchmark]: RCFGBuilder took 823.99 ms. Allocated memory is still 203.9 MB. Free memory was 153.0 MB in the beginning and 108.5 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-28 00:26:10,577 INFO L168 Benchmark]: TraceAbstraction took 68140.94 ms. Allocated memory was 203.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 107.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 969.6 MB. Max. memory is 7.1 GB. [2019-12-28 00:26:10,579 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.19 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.29 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.4 MB in the beginning and 158.3 MB in the end (delta: -57.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.86 ms. Allocated memory is still 203.9 MB. Free memory was 158.3 MB in the beginning and 155.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.19 ms. Allocated memory is still 203.9 MB. Free memory was 155.6 MB in the beginning and 153.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.99 ms. Allocated memory is still 203.9 MB. Free memory was 153.0 MB in the beginning and 108.5 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 68140.94 ms. Allocated memory was 203.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 107.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 969.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L703] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L704] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L706] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L711] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L712] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L713] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L714] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L715] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L716] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L717] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L718] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L719] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L720] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L721] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L722] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L723] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L724] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 pthread_t t241; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L810] 0 pthread_t t242; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 [L744] 1 __unbuffered_p0_EAX = x [L747] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L753] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z = z$flush_delayed ? z$mem_tmp : z [L783] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 67.7s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 32.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9016 SDtfs, 17017 SDslu, 22613 SDs, 0 SdLazy, 12035 SolverSat, 1077 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 190 SyntacticMatches, 27 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71015occurred 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: 25.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 106739 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2383 NumberOfCodeBlocks, 2383 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2253 ConstructedInterpolants, 0 QuantifiedInterpolants, 491203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...