/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.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 00:25:44,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 00:25:44,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 00:25:44,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 00:25:44,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 00:25:44,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 00:25:44,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 00:25:44,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 00:25:44,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 00:25:44,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 00:25:44,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 00:25:44,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 00:25:44,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 00:25:44,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 00:25:44,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 00:25:44,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 00:25:44,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 00:25:44,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 00:25:44,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 00:25:44,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 00:25:44,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 00:25:44,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 00:25:44,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 00:25:44,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 00:25:44,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 00:25:44,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 00:25:44,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 00:25:44,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 00:25:44,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 00:25:44,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 00:25:44,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 00:25:44,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 00:25:44,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 00:25:44,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 00:25:44,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 00:25:44,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 00:25:44,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 00:25:44,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 00:25:44,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 00:25:44,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 00:25:44,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 00:25:44,550 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:25:44,570 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 00:25:44,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 00:25:44,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 00:25:44,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 00:25:44,572 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 00:25:44,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 00:25:44,573 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 00:25:44,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 00:25:44,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 00:25:44,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 00:25:44,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 00:25:44,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 00:25:44,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 00:25:44,574 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 00:25:44,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 00:25:44,574 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 00:25:44,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 00:25:44,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 00:25:44,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 00:25:44,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 00:25:44,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 00:25:44,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 00:25:44,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 00:25:44,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 00:25:44,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 00:25:44,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 00:25:44,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 00:25:44,577 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 00:25:44,577 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 00:25:44,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 00:25:44,577 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 00:25:44,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 00:25:44,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 00:25:44,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 00:25:44,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 00:25:44,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 00:25:44,861 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 00:25:44,862 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_power.opt.i [2019-12-28 00:25:44,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d0c3b7c/c89507a672b246e29035c94d09c2735d/FLAG44e042418 [2019-12-28 00:25:45,561 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 00:25:45,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_power.opt.i [2019-12-28 00:25:45,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d0c3b7c/c89507a672b246e29035c94d09c2735d/FLAG44e042418 [2019-12-28 00:25:45,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d0c3b7c/c89507a672b246e29035c94d09c2735d [2019-12-28 00:25:45,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 00:25:45,807 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 00:25:45,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 00:25:45,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 00:25:45,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 00:25:45,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:25:45" (1/1) ... [2019-12-28 00:25:45,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e70531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:45, skipping insertion in model container [2019-12-28 00:25:45,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:25:45" (1/1) ... [2019-12-28 00:25:45,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 00:25:45,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 00:25:46,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 00:25:46,360 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 00:25:46,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 00:25:46,536 INFO L208 MainTranslator]: Completed translation [2019-12-28 00:25:46,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:46 WrapperNode [2019-12-28 00:25:46,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 00:25:46,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 00:25:46,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 00:25:46,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 00:25:46,547 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:46" (1/1) ... [2019-12-28 00:25:46,570 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:46" (1/1) ... [2019-12-28 00:25:46,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 00:25:46,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 00:25:46,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 00:25:46,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 00:25:46,616 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:46" (1/1) ... [2019-12-28 00:25:46,616 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:46" (1/1) ... [2019-12-28 00:25:46,621 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:46" (1/1) ... [2019-12-28 00:25:46,621 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:46" (1/1) ... [2019-12-28 00:25:46,633 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:46" (1/1) ... [2019-12-28 00:25:46,637 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:46" (1/1) ... [2019-12-28 00:25:46,642 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:46" (1/1) ... [2019-12-28 00:25:46,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 00:25:46,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 00:25:46,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 00:25:46,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 00:25:46,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:46" (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:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 00:25:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 00:25:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 00:25:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 00:25:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 00:25:46,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 00:25:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 00:25:46,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 00:25:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 00:25:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 00:25:46,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 00:25:46,721 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:47,485 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 00:25:47,486 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 00:25:47,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:25:47 BoogieIcfgContainer [2019-12-28 00:25:47,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 00:25:47,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 00:25:47,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 00:25:47,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 00:25:47,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 12:25:45" (1/3) ... [2019-12-28 00:25:47,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c65d2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:25:47, skipping insertion in model container [2019-12-28 00:25:47,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:25:46" (2/3) ... [2019-12-28 00:25:47,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c65d2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:25:47, skipping insertion in model container [2019-12-28 00:25:47,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:25:47" (3/3) ... [2019-12-28 00:25:47,497 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_power.opt.i [2019-12-28 00:25:47,508 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 00:25:47,508 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 00:25:47,518 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 00:25:47,519 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 00:25:47,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,566 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,613 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,613 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,642 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,644 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,654 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,658 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:25:47,676 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 00:25:47,699 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 00:25:47,700 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 00:25:47,700 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 00:25:47,700 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 00:25:47,700 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 00:25:47,700 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 00:25:47,700 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 00:25:47,700 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 00:25:47,722 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 180 places, 229 transitions [2019-12-28 00:25:56,760 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80074 states. [2019-12-28 00:25:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 80074 states. [2019-12-28 00:25:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-28 00:25:56,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:25:56,773 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] [2019-12-28 00:25:56,774 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:25:56,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:25:56,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1419186758, now seen corresponding path program 1 times [2019-12-28 00:25:56,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:25:56,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343696134] [2019-12-28 00:25:56,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:25:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:25:57,086 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:57,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343696134] [2019-12-28 00:25:57,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:25:57,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:25:57,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1936049139] [2019-12-28 00:25:57,090 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:25:57,097 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:25:57,116 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 41 transitions. [2019-12-28 00:25:57,117 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:25:57,121 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:25:57,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:25:57,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:25:57,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:25:57,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:25:57,139 INFO L87 Difference]: Start difference. First operand 80074 states. Second operand 4 states. [2019-12-28 00:25:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:25:58,404 INFO L93 Difference]: Finished difference Result 80714 states and 324639 transitions. [2019-12-28 00:25:58,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:25:58,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-28 00:25:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:25:58,832 INFO L225 Difference]: With dead ends: 80714 [2019-12-28 00:25:58,833 INFO L226 Difference]: Without dead ends: 59002 [2019-12-28 00:25:58,834 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:26:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59002 states. [2019-12-28 00:26:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59002 to 59002. [2019-12-28 00:26:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59002 states. [2019-12-28 00:26:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59002 states to 59002 states and 240127 transitions. [2019-12-28 00:26:04,271 INFO L78 Accepts]: Start accepts. Automaton has 59002 states and 240127 transitions. Word has length 41 [2019-12-28 00:26:04,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:26:04,273 INFO L462 AbstractCegarLoop]: Abstraction has 59002 states and 240127 transitions. [2019-12-28 00:26:04,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:26:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 59002 states and 240127 transitions. [2019-12-28 00:26:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 00:26:04,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:26:04,288 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:26:04,289 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:26:04,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:26:04,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1596822137, now seen corresponding path program 1 times [2019-12-28 00:26:04,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:26:04,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638770549] [2019-12-28 00:26:04,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:26:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:26:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:26:04,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638770549] [2019-12-28 00:26:04,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:26:04,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:26:04,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [828725299] [2019-12-28 00:26:04,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:26:04,490 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:26:04,498 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 49 transitions. [2019-12-28 00:26:04,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:26:04,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:26:04,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:26:04,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:26:04,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:26:04,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:26:04,504 INFO L87 Difference]: Start difference. First operand 59002 states and 240127 transitions. Second operand 5 states. [2019-12-28 00:26:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:26:08,182 INFO L93 Difference]: Finished difference Result 95596 states and 363718 transitions. [2019-12-28 00:26:08,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:26:08,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-28 00:26:08,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:26:08,652 INFO L225 Difference]: With dead ends: 95596 [2019-12-28 00:26:08,653 INFO L226 Difference]: Without dead ends: 95044 [2019-12-28 00:26:08,654 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:26:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95044 states. [2019-12-28 00:26:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95044 to 93166. [2019-12-28 00:26:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93166 states. [2019-12-28 00:26:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93166 states to 93166 states and 356304 transitions. [2019-12-28 00:26:15,847 INFO L78 Accepts]: Start accepts. Automaton has 93166 states and 356304 transitions. Word has length 49 [2019-12-28 00:26:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:26:15,848 INFO L462 AbstractCegarLoop]: Abstraction has 93166 states and 356304 transitions. [2019-12-28 00:26:15,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:26:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 93166 states and 356304 transitions. [2019-12-28 00:26:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 00:26:15,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:26:15,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:26:15,856 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:26:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:26:15,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1178649803, now seen corresponding path program 1 times [2019-12-28 00:26:15,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:26:15,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678144836] [2019-12-28 00:26:15,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:26:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:26:15,931 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:15,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678144836] [2019-12-28 00:26:15,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:26:15,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:26:15,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1154294102] [2019-12-28 00:26:15,933 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:26:15,940 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:26:15,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 122 transitions. [2019-12-28 00:26:15,957 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:26:16,052 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:26:16,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:26:16,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:26:16,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:26:16,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:26:16,054 INFO L87 Difference]: Start difference. First operand 93166 states and 356304 transitions. Second operand 6 states. [2019-12-28 00:26:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:26:17,329 INFO L93 Difference]: Finished difference Result 118510 states and 442885 transitions. [2019-12-28 00:26:17,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:26:17,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-12-28 00:26:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:26:18,794 INFO L225 Difference]: With dead ends: 118510 [2019-12-28 00:26:18,794 INFO L226 Difference]: Without dead ends: 118062 [2019-12-28 00:26:18,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:26:20,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118062 states. [2019-12-28 00:26:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118062 to 104155. [2019-12-28 00:26:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104155 states. [2019-12-28 00:26:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104155 states to 104155 states and 394238 transitions. [2019-12-28 00:26:25,553 INFO L78 Accepts]: Start accepts. Automaton has 104155 states and 394238 transitions. Word has length 50 [2019-12-28 00:26:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:26:25,554 INFO L462 AbstractCegarLoop]: Abstraction has 104155 states and 394238 transitions. [2019-12-28 00:26:25,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:26:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 104155 states and 394238 transitions. [2019-12-28 00:26:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 00:26:25,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:26:25,566 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:26:25,566 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:26:25,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:26:25,567 INFO L82 PathProgramCache]: Analyzing trace with hash -305372623, now seen corresponding path program 1 times [2019-12-28 00:26:25,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:26:25,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930478112] [2019-12-28 00:26:25,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:26:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:26:25,614 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:25,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930478112] [2019-12-28 00:26:25,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:26:25,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:26:25,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2092651056] [2019-12-28 00:26:25,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:26:25,622 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:26:25,634 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 140 transitions. [2019-12-28 00:26:25,634 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:26:25,686 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:26:25,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:26:25,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:26:25,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:26:25,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:26:25,688 INFO L87 Difference]: Start difference. First operand 104155 states and 394238 transitions. Second operand 5 states. [2019-12-28 00:26:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:26:30,520 INFO L93 Difference]: Finished difference Result 170913 states and 627060 transitions. [2019-12-28 00:26:30,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:26:30,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-28 00:26:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:26:30,984 INFO L225 Difference]: With dead ends: 170913 [2019-12-28 00:26:30,984 INFO L226 Difference]: Without dead ends: 170913 [2019-12-28 00:26:30,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:26:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170913 states. [2019-12-28 00:26:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170913 to 157191. [2019-12-28 00:26:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157191 states. [2019-12-28 00:26:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157191 states to 157191 states and 581292 transitions. [2019-12-28 00:26:36,729 INFO L78 Accepts]: Start accepts. Automaton has 157191 states and 581292 transitions. Word has length 52 [2019-12-28 00:26:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:26:36,729 INFO L462 AbstractCegarLoop]: Abstraction has 157191 states and 581292 transitions. [2019-12-28 00:26:36,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:26:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 157191 states and 581292 transitions. [2019-12-28 00:26:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:26:36,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:26:36,757 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:26:36,757 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:26:36,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:26:36,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1580132604, now seen corresponding path program 1 times [2019-12-28 00:26:36,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:26:36,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266686830] [2019-12-28 00:26:36,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:26:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:26:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:26:36,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266686830] [2019-12-28 00:26:36,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:26:36,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:26:36,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [338149165] [2019-12-28 00:26:36,837 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:26:36,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:26:36,860 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 176 transitions. [2019-12-28 00:26:36,860 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:26:36,903 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:26:36,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:26:36,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:26:36,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:26:36,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:26:36,905 INFO L87 Difference]: Start difference. First operand 157191 states and 581292 transitions. Second operand 8 states. [2019-12-28 00:26:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:26:38,910 INFO L93 Difference]: Finished difference Result 212575 states and 766174 transitions. [2019-12-28 00:26:38,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 00:26:38,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-12-28 00:26:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:26:45,265 INFO L225 Difference]: With dead ends: 212575 [2019-12-28 00:26:45,266 INFO L226 Difference]: Without dead ends: 212055 [2019-12-28 00:26:45,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 00:26:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212055 states. [2019-12-28 00:26:49,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212055 to 157973. [2019-12-28 00:26:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157973 states. [2019-12-28 00:26:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157973 states to 157973 states and 584229 transitions. [2019-12-28 00:26:50,241 INFO L78 Accepts]: Start accepts. Automaton has 157973 states and 584229 transitions. Word has length 56 [2019-12-28 00:26:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:26:50,242 INFO L462 AbstractCegarLoop]: Abstraction has 157973 states and 584229 transitions. [2019-12-28 00:26:50,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:26:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 157973 states and 584229 transitions. [2019-12-28 00:26:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:26:50,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:26:50,261 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:26:50,262 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:26:50,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:26:50,262 INFO L82 PathProgramCache]: Analyzing trace with hash 193567859, now seen corresponding path program 1 times [2019-12-28 00:26:50,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:26:50,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152899562] [2019-12-28 00:26:50,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:26:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:26:50,314 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:50,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152899562] [2019-12-28 00:26:50,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:26:50,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:26:50,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1107164526] [2019-12-28 00:26:50,315 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:26:50,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:26:50,328 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 60 transitions. [2019-12-28 00:26:50,329 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:26:50,330 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:26:50,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:26:50,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:26:50,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:26:50,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:26:50,331 INFO L87 Difference]: Start difference. First operand 157973 states and 584229 transitions. Second operand 3 states. [2019-12-28 00:26:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:26:52,427 INFO L93 Difference]: Finished difference Result 175833 states and 650717 transitions. [2019-12-28 00:26:52,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:26:52,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-28 00:26:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:26:52,887 INFO L225 Difference]: With dead ends: 175833 [2019-12-28 00:26:52,887 INFO L226 Difference]: Without dead ends: 175833 [2019-12-28 00:26:52,887 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:26:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175833 states. [2019-12-28 00:27:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175833 to 166853. [2019-12-28 00:27:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166853 states. [2019-12-28 00:27:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166853 states to 166853 states and 617305 transitions. [2019-12-28 00:27:06,854 INFO L78 Accepts]: Start accepts. Automaton has 166853 states and 617305 transitions. Word has length 56 [2019-12-28 00:27:06,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:27:06,855 INFO L462 AbstractCegarLoop]: Abstraction has 166853 states and 617305 transitions. [2019-12-28 00:27:06,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:27:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 166853 states and 617305 transitions. [2019-12-28 00:27:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:27:06,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:27:06,875 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:27:06,875 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:27:06,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:27:06,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1320483597, now seen corresponding path program 1 times [2019-12-28 00:27:06,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:27:06,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55389134] [2019-12-28 00:27:06,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:27:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:27:06,990 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:27:06,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55389134] [2019-12-28 00:27:06,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:27:06,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:27:06,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2056149624] [2019-12-28 00:27:06,991 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:27:06,996 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:27:07,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 60 transitions. [2019-12-28 00:27:07,003 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:27:07,031 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:27:07,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:27:07,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:27:07,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:27:07,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:27:07,033 INFO L87 Difference]: Start difference. First operand 166853 states and 617305 transitions. Second operand 8 states. [2019-12-28 00:27:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:27:09,703 INFO L93 Difference]: Finished difference Result 213770 states and 787341 transitions. [2019-12-28 00:27:09,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 00:27:09,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-12-28 00:27:09,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:27:10,295 INFO L225 Difference]: With dead ends: 213770 [2019-12-28 00:27:10,295 INFO L226 Difference]: Without dead ends: 213770 [2019-12-28 00:27:10,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:27:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213770 states. [2019-12-28 00:27:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213770 to 193996. [2019-12-28 00:27:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193996 states. [2019-12-28 00:27:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193996 states to 193996 states and 714237 transitions. [2019-12-28 00:27:21,949 INFO L78 Accepts]: Start accepts. Automaton has 193996 states and 714237 transitions. Word has length 56 [2019-12-28 00:27:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:27:21,949 INFO L462 AbstractCegarLoop]: Abstraction has 193996 states and 714237 transitions. [2019-12-28 00:27:21,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:27:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 193996 states and 714237 transitions. [2019-12-28 00:27:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:27:21,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:27:21,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:27:21,977 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:27:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:27:21,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1177532340, now seen corresponding path program 1 times [2019-12-28 00:27:21,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:27:21,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690561750] [2019-12-28 00:27:21,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:27:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:27:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:27:22,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690561750] [2019-12-28 00:27:22,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:27:22,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:27:22,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1661242213] [2019-12-28 00:27:22,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:27:22,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:27:22,142 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 60 transitions. [2019-12-28 00:27:22,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:27:22,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:27:22,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 00:27:22,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:27:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 00:27:22,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:27:22,169 INFO L87 Difference]: Start difference. First operand 193996 states and 714237 transitions. Second operand 9 states. [2019-12-28 00:27:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:27:31,046 INFO L93 Difference]: Finished difference Result 277139 states and 986577 transitions. [2019-12-28 00:27:31,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 00:27:31,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-28 00:27:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:27:31,810 INFO L225 Difference]: With dead ends: 277139 [2019-12-28 00:27:31,810 INFO L226 Difference]: Without dead ends: 277139 [2019-12-28 00:27:31,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-28 00:27:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277139 states. [2019-12-28 00:27:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277139 to 222095. [2019-12-28 00:27:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222095 states. [2019-12-28 00:27:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222095 states to 222095 states and 805381 transitions. [2019-12-28 00:27:39,547 INFO L78 Accepts]: Start accepts. Automaton has 222095 states and 805381 transitions. Word has length 56 [2019-12-28 00:27:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:27:39,547 INFO L462 AbstractCegarLoop]: Abstraction has 222095 states and 805381 transitions. [2019-12-28 00:27:39,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 00:27:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 222095 states and 805381 transitions. [2019-12-28 00:27:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:27:39,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:27:39,573 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:27:39,574 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:27:39,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:27:39,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2065036021, now seen corresponding path program 1 times [2019-12-28 00:27:39,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:27:39,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102346388] [2019-12-28 00:27:39,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:27:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:27:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:27:39,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102346388] [2019-12-28 00:27:39,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:27:39,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:27:39,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1568864912] [2019-12-28 00:27:39,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:27:39,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:27:39,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 60 transitions. [2019-12-28 00:27:39,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:27:39,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:27:39,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:27:39,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:27:39,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:27:39,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:27:39,642 INFO L87 Difference]: Start difference. First operand 222095 states and 805381 transitions. Second operand 3 states. [2019-12-28 00:27:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:27:40,430 INFO L93 Difference]: Finished difference Result 176991 states and 632039 transitions. [2019-12-28 00:27:40,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:27:40,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-28 00:27:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:27:47,496 INFO L225 Difference]: With dead ends: 176991 [2019-12-28 00:27:47,496 INFO L226 Difference]: Without dead ends: 176991 [2019-12-28 00:27:47,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:27:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176991 states. [2019-12-28 00:27:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176991 to 172179. [2019-12-28 00:27:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172179 states. [2019-12-28 00:27:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172179 states to 172179 states and 617064 transitions. [2019-12-28 00:27:52,185 INFO L78 Accepts]: Start accepts. Automaton has 172179 states and 617064 transitions. Word has length 56 [2019-12-28 00:27:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:27:52,185 INFO L462 AbstractCegarLoop]: Abstraction has 172179 states and 617064 transitions. [2019-12-28 00:27:52,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:27:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 172179 states and 617064 transitions. [2019-12-28 00:27:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 00:27:52,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:27:52,207 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:27:52,207 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:27:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:27:52,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1638616881, now seen corresponding path program 1 times [2019-12-28 00:27:52,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:27:52,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11591191] [2019-12-28 00:27:52,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:27:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:27:52,294 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:27:52,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11591191] [2019-12-28 00:27:52,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:27:52,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:27:52,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1669568974] [2019-12-28 00:27:52,296 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:27:52,301 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:27:52,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-28 00:27:52,307 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:27:52,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:27:52,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:27:52,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:27:52,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:27:52,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:27:52,308 INFO L87 Difference]: Start difference. First operand 172179 states and 617064 transitions. Second operand 6 states. [2019-12-28 00:27:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:27:54,690 INFO L93 Difference]: Finished difference Result 216118 states and 757197 transitions. [2019-12-28 00:27:54,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:27:54,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-28 00:27:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:27:55,215 INFO L225 Difference]: With dead ends: 216118 [2019-12-28 00:27:55,215 INFO L226 Difference]: Without dead ends: 216118 [2019-12-28 00:27:55,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:28:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216118 states. [2019-12-28 00:28:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216118 to 185519. [2019-12-28 00:28:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185519 states. [2019-12-28 00:28:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185519 states to 185519 states and 660439 transitions. [2019-12-28 00:28:07,183 INFO L78 Accepts]: Start accepts. Automaton has 185519 states and 660439 transitions. Word has length 57 [2019-12-28 00:28:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:07,183 INFO L462 AbstractCegarLoop]: Abstraction has 185519 states and 660439 transitions. [2019-12-28 00:28:07,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:28:07,183 INFO L276 IsEmpty]: Start isEmpty. Operand 185519 states and 660439 transitions. [2019-12-28 00:28:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 00:28:07,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:07,200 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:28:07,200 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:07,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:07,200 INFO L82 PathProgramCache]: Analyzing trace with hash -751113200, now seen corresponding path program 1 times [2019-12-28 00:28:07,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:07,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322147857] [2019-12-28 00:28:07,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:07,261 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:28:07,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322147857] [2019-12-28 00:28:07,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:07,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:28:07,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [825459025] [2019-12-28 00:28:07,263 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:07,268 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:07,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-28 00:28:07,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:07,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:28:07,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:28:07,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:07,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:28:07,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:28:07,275 INFO L87 Difference]: Start difference. First operand 185519 states and 660439 transitions. Second operand 4 states. [2019-12-28 00:28:07,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:07,387 INFO L93 Difference]: Finished difference Result 24459 states and 76335 transitions. [2019-12-28 00:28:07,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:28:07,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-28 00:28:07,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:07,416 INFO L225 Difference]: With dead ends: 24459 [2019-12-28 00:28:07,416 INFO L226 Difference]: Without dead ends: 18440 [2019-12-28 00:28:07,416 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:28:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18440 states. [2019-12-28 00:28:07,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18440 to 18193. [2019-12-28 00:28:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18193 states. [2019-12-28 00:28:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18193 states to 18193 states and 54576 transitions. [2019-12-28 00:28:07,661 INFO L78 Accepts]: Start accepts. Automaton has 18193 states and 54576 transitions. Word has length 57 [2019-12-28 00:28:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:07,661 INFO L462 AbstractCegarLoop]: Abstraction has 18193 states and 54576 transitions. [2019-12-28 00:28:07,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:28:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 18193 states and 54576 transitions. [2019-12-28 00:28:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 00:28:07,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:07,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:28:07,666 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash -914504522, now seen corresponding path program 1 times [2019-12-28 00:28:07,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:07,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847484744] [2019-12-28 00:28:07,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:07,715 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:28:07,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847484744] [2019-12-28 00:28:07,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:07,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:28:07,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1926759225] [2019-12-28 00:28:07,716 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:07,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:07,750 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 202 transitions. [2019-12-28 00:28:07,750 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:07,766 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:28:07,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:28:07,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:07,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:28:07,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:28:07,767 INFO L87 Difference]: Start difference. First operand 18193 states and 54576 transitions. Second operand 5 states. [2019-12-28 00:28:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:08,057 INFO L93 Difference]: Finished difference Result 23513 states and 70754 transitions. [2019-12-28 00:28:08,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:28:08,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 00:28:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:08,091 INFO L225 Difference]: With dead ends: 23513 [2019-12-28 00:28:08,091 INFO L226 Difference]: Without dead ends: 23513 [2019-12-28 00:28:08,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:28:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23513 states. [2019-12-28 00:28:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23513 to 21215. [2019-12-28 00:28:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21215 states. [2019-12-28 00:28:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21215 states to 21215 states and 63561 transitions. [2019-12-28 00:28:08,395 INFO L78 Accepts]: Start accepts. Automaton has 21215 states and 63561 transitions. Word has length 66 [2019-12-28 00:28:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:08,396 INFO L462 AbstractCegarLoop]: Abstraction has 21215 states and 63561 transitions. [2019-12-28 00:28:08,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:28:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 21215 states and 63561 transitions. [2019-12-28 00:28:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 00:28:08,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:08,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:28:08,401 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:08,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:08,402 INFO L82 PathProgramCache]: Analyzing trace with hash 828305813, now seen corresponding path program 1 times [2019-12-28 00:28:08,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:08,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289273650] [2019-12-28 00:28:08,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:08,473 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:28:08,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289273650] [2019-12-28 00:28:08,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:08,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:28:08,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1803289995] [2019-12-28 00:28:08,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:08,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:08,509 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 202 transitions. [2019-12-28 00:28:08,509 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:08,529 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:28:08,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:28:08,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:08,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:28:08,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:28:08,530 INFO L87 Difference]: Start difference. First operand 21215 states and 63561 transitions. Second operand 7 states. [2019-12-28 00:28:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:09,287 INFO L93 Difference]: Finished difference Result 30327 states and 89101 transitions. [2019-12-28 00:28:09,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 00:28:09,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-28 00:28:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:10,343 INFO L225 Difference]: With dead ends: 30327 [2019-12-28 00:28:10,343 INFO L226 Difference]: Without dead ends: 30279 [2019-12-28 00:28:10,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 00:28:10,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30279 states. [2019-12-28 00:28:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30279 to 27632. [2019-12-28 00:28:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27632 states. [2019-12-28 00:28:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27632 states to 27632 states and 81448 transitions. [2019-12-28 00:28:10,713 INFO L78 Accepts]: Start accepts. Automaton has 27632 states and 81448 transitions. Word has length 66 [2019-12-28 00:28:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:10,713 INFO L462 AbstractCegarLoop]: Abstraction has 27632 states and 81448 transitions. [2019-12-28 00:28:10,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:28:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27632 states and 81448 transitions. [2019-12-28 00:28:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-28 00:28:10,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:10,723 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] [2019-12-28 00:28:10,723 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash 17339334, now seen corresponding path program 1 times [2019-12-28 00:28:10,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:10,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45811997] [2019-12-28 00:28:10,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:10,771 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:28:10,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45811997] [2019-12-28 00:28:10,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:10,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:28:10,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [637594945] [2019-12-28 00:28:10,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:10,784 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:10,827 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 256 transitions. [2019-12-28 00:28:10,827 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:10,854 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:28:10,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:28:10,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:10,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:28:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:28:10,856 INFO L87 Difference]: Start difference. First operand 27632 states and 81448 transitions. Second operand 5 states. [2019-12-28 00:28:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:11,061 INFO L93 Difference]: Finished difference Result 30275 states and 87662 transitions. [2019-12-28 00:28:11,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:28:11,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-28 00:28:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:11,103 INFO L225 Difference]: With dead ends: 30275 [2019-12-28 00:28:11,104 INFO L226 Difference]: Without dead ends: 30275 [2019-12-28 00:28:11,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:28:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30275 states. [2019-12-28 00:28:11,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30275 to 26780. [2019-12-28 00:28:11,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26780 states. [2019-12-28 00:28:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26780 states to 26780 states and 76976 transitions. [2019-12-28 00:28:11,484 INFO L78 Accepts]: Start accepts. Automaton has 26780 states and 76976 transitions. Word has length 72 [2019-12-28 00:28:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:11,484 INFO L462 AbstractCegarLoop]: Abstraction has 26780 states and 76976 transitions. [2019-12-28 00:28:11,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:28:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 26780 states and 76976 transitions. [2019-12-28 00:28:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-28 00:28:11,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:11,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:11,496 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash -709057717, now seen corresponding path program 1 times [2019-12-28 00:28:11,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:11,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490321510] [2019-12-28 00:28:11,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:11,586 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:28:11,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490321510] [2019-12-28 00:28:11,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:11,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:28:11,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [179041431] [2019-12-28 00:28:11,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:11,601 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:11,630 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 210 transitions. [2019-12-28 00:28:11,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:11,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:28:11,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:28:11,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:11,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:28:11,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:28:11,646 INFO L87 Difference]: Start difference. First operand 26780 states and 76976 transitions. Second operand 6 states. [2019-12-28 00:28:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:11,746 INFO L93 Difference]: Finished difference Result 10367 states and 25885 transitions. [2019-12-28 00:28:11,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:28:11,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-28 00:28:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:11,759 INFO L225 Difference]: With dead ends: 10367 [2019-12-28 00:28:11,760 INFO L226 Difference]: Without dead ends: 9062 [2019-12-28 00:28:11,760 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:28:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9062 states. [2019-12-28 00:28:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9062 to 7007. [2019-12-28 00:28:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7007 states. [2019-12-28 00:28:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7007 states to 7007 states and 17495 transitions. [2019-12-28 00:28:13,392 INFO L78 Accepts]: Start accepts. Automaton has 7007 states and 17495 transitions. Word has length 74 [2019-12-28 00:28:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:13,392 INFO L462 AbstractCegarLoop]: Abstraction has 7007 states and 17495 transitions. [2019-12-28 00:28:13,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:28:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7007 states and 17495 transitions. [2019-12-28 00:28:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:28:13,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:13,400 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, 1, 1, 1, 1] [2019-12-28 00:28:13,400 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash -59117604, now seen corresponding path program 1 times [2019-12-28 00:28:13,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:13,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201191043] [2019-12-28 00:28:13,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:13,499 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:28:13,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201191043] [2019-12-28 00:28:13,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:13,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:28:13,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [498695563] [2019-12-28 00:28:13,500 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:13,528 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:13,594 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 164 transitions. [2019-12-28 00:28:13,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:13,612 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 00:28:13,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:28:13,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:28:13,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:28:13,613 INFO L87 Difference]: Start difference. First operand 7007 states and 17495 transitions. Second operand 8 states. [2019-12-28 00:28:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:15,447 INFO L93 Difference]: Finished difference Result 14541 states and 35218 transitions. [2019-12-28 00:28:15,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 00:28:15,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-12-28 00:28:15,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:15,470 INFO L225 Difference]: With dead ends: 14541 [2019-12-28 00:28:15,471 INFO L226 Difference]: Without dead ends: 14519 [2019-12-28 00:28:15,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-12-28 00:28:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14519 states. [2019-12-28 00:28:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14519 to 11727. [2019-12-28 00:28:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-12-28 00:28:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 28811 transitions. [2019-12-28 00:28:15,619 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 28811 transitions. Word has length 103 [2019-12-28 00:28:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:15,620 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 28811 transitions. [2019-12-28 00:28:15,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:28:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 28811 transitions. [2019-12-28 00:28:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:28:15,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:15,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:15,636 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:15,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:15,636 INFO L82 PathProgramCache]: Analyzing trace with hash -70433731, now seen corresponding path program 1 times [2019-12-28 00:28:15,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:15,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592386542] [2019-12-28 00:28:15,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:15,707 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:28:15,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592386542] [2019-12-28 00:28:15,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:15,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:28:15,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1825899568] [2019-12-28 00:28:15,708 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:15,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:15,828 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 164 transitions. [2019-12-28 00:28:15,828 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:15,829 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:28:15,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:28:15,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:15,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:28:15,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:28:15,830 INFO L87 Difference]: Start difference. First operand 11727 states and 28811 transitions. Second operand 4 states. [2019-12-28 00:28:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:16,061 INFO L93 Difference]: Finished difference Result 13008 states and 31435 transitions. [2019-12-28 00:28:16,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:28:16,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-28 00:28:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:16,079 INFO L225 Difference]: With dead ends: 13008 [2019-12-28 00:28:16,079 INFO L226 Difference]: Without dead ends: 12944 [2019-12-28 00:28:16,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:28:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2019-12-28 00:28:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 12430. [2019-12-28 00:28:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12430 states. [2019-12-28 00:28:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12430 states to 12430 states and 30202 transitions. [2019-12-28 00:28:16,301 INFO L78 Accepts]: Start accepts. Automaton has 12430 states and 30202 transitions. Word has length 103 [2019-12-28 00:28:16,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:16,301 INFO L462 AbstractCegarLoop]: Abstraction has 12430 states and 30202 transitions. [2019-12-28 00:28:16,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:28:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 12430 states and 30202 transitions. [2019-12-28 00:28:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:28:16,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:16,316 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, 1, 1, 1, 1] [2019-12-28 00:28:16,316 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2069221445, now seen corresponding path program 1 times [2019-12-28 00:28:16,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:16,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952663219] [2019-12-28 00:28:16,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:16,449 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:28:16,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952663219] [2019-12-28 00:28:16,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:16,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:28:16,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [769809338] [2019-12-28 00:28:16,450 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:16,480 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:16,585 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 164 transitions. [2019-12-28 00:28:16,586 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:16,587 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:28:16,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:28:16,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:16,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:28:16,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:28:16,588 INFO L87 Difference]: Start difference. First operand 12430 states and 30202 transitions. Second operand 7 states. [2019-12-28 00:28:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:17,373 INFO L93 Difference]: Finished difference Result 17333 states and 40395 transitions. [2019-12-28 00:28:17,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 00:28:17,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-28 00:28:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:17,392 INFO L225 Difference]: With dead ends: 17333 [2019-12-28 00:28:17,392 INFO L226 Difference]: Without dead ends: 17333 [2019-12-28 00:28:17,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:28:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2019-12-28 00:28:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 14822. [2019-12-28 00:28:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14822 states. [2019-12-28 00:28:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14822 states to 14822 states and 35027 transitions. [2019-12-28 00:28:17,580 INFO L78 Accepts]: Start accepts. Automaton has 14822 states and 35027 transitions. Word has length 103 [2019-12-28 00:28:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:17,581 INFO L462 AbstractCegarLoop]: Abstraction has 14822 states and 35027 transitions. [2019-12-28 00:28:17,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:28:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 14822 states and 35027 transitions. [2019-12-28 00:28:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:28:17,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:17,595 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, 1, 1, 1, 1] [2019-12-28 00:28:17,595 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:17,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:17,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1971009306, now seen corresponding path program 1 times [2019-12-28 00:28:17,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:17,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836881970] [2019-12-28 00:28:17,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:17,673 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:28:17,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836881970] [2019-12-28 00:28:17,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:17,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:28:17,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443549563] [2019-12-28 00:28:17,674 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:17,694 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:17,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 164 transitions. [2019-12-28 00:28:17,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:17,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:28:17,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:28:17,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:17,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:28:17,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:28:17,776 INFO L87 Difference]: Start difference. First operand 14822 states and 35027 transitions. Second operand 4 states. [2019-12-28 00:28:17,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:17,828 INFO L93 Difference]: Finished difference Result 14822 states and 35009 transitions. [2019-12-28 00:28:17,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:28:17,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-28 00:28:17,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:17,847 INFO L225 Difference]: With dead ends: 14822 [2019-12-28 00:28:17,847 INFO L226 Difference]: Without dead ends: 14822 [2019-12-28 00:28:17,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:28:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14822 states. [2019-12-28 00:28:18,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14822 to 14501. [2019-12-28 00:28:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14501 states. [2019-12-28 00:28:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14501 states to 14501 states and 34280 transitions. [2019-12-28 00:28:18,134 INFO L78 Accepts]: Start accepts. Automaton has 14501 states and 34280 transitions. Word has length 103 [2019-12-28 00:28:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:18,135 INFO L462 AbstractCegarLoop]: Abstraction has 14501 states and 34280 transitions. [2019-12-28 00:28:18,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:28:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 14501 states and 34280 transitions. [2019-12-28 00:28:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:28:18,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:18,149 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, 1, 1, 1, 1] [2019-12-28 00:28:18,149 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:18,150 INFO L82 PathProgramCache]: Analyzing trace with hash -336476230, now seen corresponding path program 1 times [2019-12-28 00:28:18,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:18,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17814514] [2019-12-28 00:28:18,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:28:18,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17814514] [2019-12-28 00:28:18,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:18,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:28:18,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [526138652] [2019-12-28 00:28:18,225 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:18,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:18,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 164 transitions. [2019-12-28 00:28:18,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:18,347 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:28:18,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:28:18,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:28:18,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:28:18,348 INFO L87 Difference]: Start difference. First operand 14501 states and 34280 transitions. Second operand 4 states. [2019-12-28 00:28:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:18,663 INFO L93 Difference]: Finished difference Result 14577 states and 34470 transitions. [2019-12-28 00:28:18,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:28:18,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-28 00:28:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:18,688 INFO L225 Difference]: With dead ends: 14577 [2019-12-28 00:28:18,688 INFO L226 Difference]: Without dead ends: 14577 [2019-12-28 00:28:18,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:28:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14577 states. [2019-12-28 00:28:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14577 to 13987. [2019-12-28 00:28:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13987 states. [2019-12-28 00:28:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 33135 transitions. [2019-12-28 00:28:18,915 INFO L78 Accepts]: Start accepts. Automaton has 13987 states and 33135 transitions. Word has length 103 [2019-12-28 00:28:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:18,916 INFO L462 AbstractCegarLoop]: Abstraction has 13987 states and 33135 transitions. [2019-12-28 00:28:18,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:28:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 13987 states and 33135 transitions. [2019-12-28 00:28:18,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:28:18,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:18,933 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, 1, 1, 1, 1] [2019-12-28 00:28:18,933 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:18,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:18,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1879253812, now seen corresponding path program 2 times [2019-12-28 00:28:18,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:18,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036118332] [2019-12-28 00:28:18,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:19,035 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:28:19,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036118332] [2019-12-28 00:28:19,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:19,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:28:19,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039168825] [2019-12-28 00:28:19,036 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:19,056 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:19,154 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 159 transitions. [2019-12-28 00:28:19,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:19,155 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:28:19,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:28:19,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:19,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:28:19,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:28:19,157 INFO L87 Difference]: Start difference. First operand 13987 states and 33135 transitions. Second operand 5 states. [2019-12-28 00:28:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:19,229 INFO L93 Difference]: Finished difference Result 13987 states and 33126 transitions. [2019-12-28 00:28:19,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:28:19,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-12-28 00:28:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:19,246 INFO L225 Difference]: With dead ends: 13987 [2019-12-28 00:28:19,247 INFO L226 Difference]: Without dead ends: 13987 [2019-12-28 00:28:19,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:28:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13987 states. [2019-12-28 00:28:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13987 to 13987. [2019-12-28 00:28:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13987 states. [2019-12-28 00:28:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 33126 transitions. [2019-12-28 00:28:19,400 INFO L78 Accepts]: Start accepts. Automaton has 13987 states and 33126 transitions. Word has length 103 [2019-12-28 00:28:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:19,400 INFO L462 AbstractCegarLoop]: Abstraction has 13987 states and 33126 transitions. [2019-12-28 00:28:19,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:28:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 13987 states and 33126 transitions. [2019-12-28 00:28:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:28:19,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:19,413 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, 1, 1, 1, 1] [2019-12-28 00:28:19,414 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:19,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:19,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1528209803, now seen corresponding path program 1 times [2019-12-28 00:28:19,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:19,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175137731] [2019-12-28 00:28:19,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:19,486 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:28:19,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175137731] [2019-12-28 00:28:19,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:19,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:28:19,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1334050923] [2019-12-28 00:28:19,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:19,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:19,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 159 transitions. [2019-12-28 00:28:19,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:19,704 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:28:19,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:28:19,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:19,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:28:19,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:28:19,708 INFO L87 Difference]: Start difference. First operand 13987 states and 33126 transitions. Second operand 5 states. [2019-12-28 00:28:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:20,267 INFO L93 Difference]: Finished difference Result 14917 states and 35123 transitions. [2019-12-28 00:28:20,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:28:20,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-12-28 00:28:20,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:20,289 INFO L225 Difference]: With dead ends: 14917 [2019-12-28 00:28:20,289 INFO L226 Difference]: Without dead ends: 14917 [2019-12-28 00:28:20,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:28:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14917 states. [2019-12-28 00:28:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14917 to 13954. [2019-12-28 00:28:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13954 states. [2019-12-28 00:28:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13954 states to 13954 states and 32992 transitions. [2019-12-28 00:28:20,519 INFO L78 Accepts]: Start accepts. Automaton has 13954 states and 32992 transitions. Word has length 103 [2019-12-28 00:28:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:20,519 INFO L462 AbstractCegarLoop]: Abstraction has 13954 states and 32992 transitions. [2019-12-28 00:28:20,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:28:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 13954 states and 32992 transitions. [2019-12-28 00:28:20,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:28:20,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:20,533 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, 1, 1, 1, 1] [2019-12-28 00:28:20,533 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:20,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:20,534 INFO L82 PathProgramCache]: Analyzing trace with hash -606803679, now seen corresponding path program 2 times [2019-12-28 00:28:20,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:20,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731674092] [2019-12-28 00:28:20,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:20,591 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:28:20,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731674092] [2019-12-28 00:28:20,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:20,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:28:20,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [858814412] [2019-12-28 00:28:20,598 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:20,617 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:20,688 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 185 transitions. [2019-12-28 00:28:20,688 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:20,689 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 00:28:20,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:28:20,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:20,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:28:20,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:28:20,690 INFO L87 Difference]: Start difference. First operand 13954 states and 32992 transitions. Second operand 3 states. [2019-12-28 00:28:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:20,742 INFO L93 Difference]: Finished difference Result 16696 states and 39413 transitions. [2019-12-28 00:28:20,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:28:20,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-28 00:28:20,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:20,760 INFO L225 Difference]: With dead ends: 16696 [2019-12-28 00:28:20,760 INFO L226 Difference]: Without dead ends: 16696 [2019-12-28 00:28:20,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:28:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16696 states. [2019-12-28 00:28:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16696 to 16642. [2019-12-28 00:28:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16642 states. [2019-12-28 00:28:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16642 states to 16642 states and 39295 transitions. [2019-12-28 00:28:20,940 INFO L78 Accepts]: Start accepts. Automaton has 16642 states and 39295 transitions. Word has length 103 [2019-12-28 00:28:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:20,941 INFO L462 AbstractCegarLoop]: Abstraction has 16642 states and 39295 transitions. [2019-12-28 00:28:20,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:28:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 16642 states and 39295 transitions. [2019-12-28 00:28:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:28:20,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:20,955 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, 1, 1, 1, 1] [2019-12-28 00:28:20,955 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:20,955 INFO L82 PathProgramCache]: Analyzing trace with hash -395452766, now seen corresponding path program 1 times [2019-12-28 00:28:20,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:20,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535912391] [2019-12-28 00:28:20,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:21,054 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:28:21,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535912391] [2019-12-28 00:28:21,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:21,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:28:21,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2047681952] [2019-12-28 00:28:21,056 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:21,084 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:21,185 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 185 transitions. [2019-12-28 00:28:21,185 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:21,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:28:21,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:28:21,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:21,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:28:21,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:28:21,198 INFO L87 Difference]: Start difference. First operand 16642 states and 39295 transitions. Second operand 7 states. [2019-12-28 00:28:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:21,873 INFO L93 Difference]: Finished difference Result 19819 states and 46535 transitions. [2019-12-28 00:28:21,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:28:21,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-28 00:28:21,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:21,894 INFO L225 Difference]: With dead ends: 19819 [2019-12-28 00:28:21,894 INFO L226 Difference]: Without dead ends: 19819 [2019-12-28 00:28:21,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:28:21,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19819 states. [2019-12-28 00:28:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19819 to 16677. [2019-12-28 00:28:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16677 states. [2019-12-28 00:28:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16677 states to 16677 states and 39371 transitions. [2019-12-28 00:28:22,095 INFO L78 Accepts]: Start accepts. Automaton has 16677 states and 39371 transitions. Word has length 103 [2019-12-28 00:28:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:22,095 INFO L462 AbstractCegarLoop]: Abstraction has 16677 states and 39371 transitions. [2019-12-28 00:28:22,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:28:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 16677 states and 39371 transitions. [2019-12-28 00:28:22,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:28:22,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:22,110 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, 1, 1, 1, 1] [2019-12-28 00:28:22,111 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:22,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2015950754, now seen corresponding path program 2 times [2019-12-28 00:28:22,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:22,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722301489] [2019-12-28 00:28:22,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:22,178 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:28:22,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722301489] [2019-12-28 00:28:22,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:22,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:28:22,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153116958] [2019-12-28 00:28:22,180 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:22,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:22,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 211 transitions. [2019-12-28 00:28:22,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:22,365 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 00:28:22,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:28:22,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:22,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:28:22,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:28:22,367 INFO L87 Difference]: Start difference. First operand 16677 states and 39371 transitions. Second operand 8 states. [2019-12-28 00:28:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:23,319 INFO L93 Difference]: Finished difference Result 20729 states and 47973 transitions. [2019-12-28 00:28:23,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 00:28:23,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-12-28 00:28:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:23,350 INFO L225 Difference]: With dead ends: 20729 [2019-12-28 00:28:23,350 INFO L226 Difference]: Without dead ends: 20729 [2019-12-28 00:28:23,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:28:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20729 states. [2019-12-28 00:28:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20729 to 17388. [2019-12-28 00:28:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17388 states. [2019-12-28 00:28:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17388 states to 17388 states and 40865 transitions. [2019-12-28 00:28:23,661 INFO L78 Accepts]: Start accepts. Automaton has 17388 states and 40865 transitions. Word has length 103 [2019-12-28 00:28:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:23,661 INFO L462 AbstractCegarLoop]: Abstraction has 17388 states and 40865 transitions. [2019-12-28 00:28:23,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:28:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 17388 states and 40865 transitions. [2019-12-28 00:28:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:28:23,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:23,678 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, 1, 1, 1, 1, 1, 1] [2019-12-28 00:28:23,678 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1862635831, now seen corresponding path program 1 times [2019-12-28 00:28:23,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:23,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724648984] [2019-12-28 00:28:23,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:23,832 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:28:23,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724648984] [2019-12-28 00:28:23,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:23,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 00:28:23,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [872947378] [2019-12-28 00:28:23,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:23,853 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:24,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 172 transitions. [2019-12-28 00:28:24,023 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:24,069 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 00:28:24,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 00:28:24,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:24,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 00:28:24,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:28:24,071 INFO L87 Difference]: Start difference. First operand 17388 states and 40865 transitions. Second operand 11 states. [2019-12-28 00:28:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:24,605 INFO L93 Difference]: Finished difference Result 30767 states and 72531 transitions. [2019-12-28 00:28:24,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 00:28:24,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-12-28 00:28:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:24,638 INFO L225 Difference]: With dead ends: 30767 [2019-12-28 00:28:24,638 INFO L226 Difference]: Without dead ends: 27353 [2019-12-28 00:28:24,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-12-28 00:28:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27353 states. [2019-12-28 00:28:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27353 to 20516. [2019-12-28 00:28:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20516 states. [2019-12-28 00:28:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20516 states to 20516 states and 47985 transitions. [2019-12-28 00:28:24,913 INFO L78 Accepts]: Start accepts. Automaton has 20516 states and 47985 transitions. Word has length 105 [2019-12-28 00:28:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:24,914 INFO L462 AbstractCegarLoop]: Abstraction has 20516 states and 47985 transitions. [2019-12-28 00:28:24,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 00:28:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 20516 states and 47985 transitions. [2019-12-28 00:28:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:28:24,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:24,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, 1, 1, 1, 1, 1, 1] [2019-12-28 00:28:24,934 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:24,934 INFO L82 PathProgramCache]: Analyzing trace with hash 543960296, now seen corresponding path program 1 times [2019-12-28 00:28:24,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:24,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578200633] [2019-12-28 00:28:24,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:25,029 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:28:25,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578200633] [2019-12-28 00:28:25,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:25,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:28:25,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716167344] [2019-12-28 00:28:25,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:25,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:25,127 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 199 transitions. [2019-12-28 00:28:25,127 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:25,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 00:28:25,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:28:25,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:25,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:28:25,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:28:25,141 INFO L87 Difference]: Start difference. First operand 20516 states and 47985 transitions. Second operand 8 states. [2019-12-28 00:28:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:26,643 INFO L93 Difference]: Finished difference Result 28315 states and 65227 transitions. [2019-12-28 00:28:26,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 00:28:26,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-12-28 00:28:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:26,674 INFO L225 Difference]: With dead ends: 28315 [2019-12-28 00:28:26,674 INFO L226 Difference]: Without dead ends: 28251 [2019-12-28 00:28:26,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-12-28 00:28:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28251 states. [2019-12-28 00:28:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28251 to 21093. [2019-12-28 00:28:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21093 states. [2019-12-28 00:28:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21093 states to 21093 states and 49182 transitions. [2019-12-28 00:28:27,066 INFO L78 Accepts]: Start accepts. Automaton has 21093 states and 49182 transitions. Word has length 105 [2019-12-28 00:28:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:27,067 INFO L462 AbstractCegarLoop]: Abstraction has 21093 states and 49182 transitions. [2019-12-28 00:28:27,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:28:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 21093 states and 49182 transitions. [2019-12-28 00:28:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:28:27,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:27,086 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, 1, 1, 1, 1, 1, 1] [2019-12-28 00:28:27,087 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:27,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:27,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1533249047, now seen corresponding path program 1 times [2019-12-28 00:28:27,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:27,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533966831] [2019-12-28 00:28:27,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:27,219 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:28:27,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533966831] [2019-12-28 00:28:27,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:27,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:28:27,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1422067772] [2019-12-28 00:28:27,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:27,242 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:27,338 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 199 transitions. [2019-12-28 00:28:27,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:27,357 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:28:27,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:28:27,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:27,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:28:27,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:28:27,358 INFO L87 Difference]: Start difference. First operand 21093 states and 49182 transitions. Second operand 8 states. [2019-12-28 00:28:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:27,534 INFO L93 Difference]: Finished difference Result 21631 states and 50317 transitions. [2019-12-28 00:28:27,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:28:27,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-12-28 00:28:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:27,554 INFO L225 Difference]: With dead ends: 21631 [2019-12-28 00:28:27,554 INFO L226 Difference]: Without dead ends: 16107 [2019-12-28 00:28:27,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:28:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16107 states. [2019-12-28 00:28:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16107 to 16105. [2019-12-28 00:28:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16105 states. [2019-12-28 00:28:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16105 states to 16105 states and 37895 transitions. [2019-12-28 00:28:27,729 INFO L78 Accepts]: Start accepts. Automaton has 16105 states and 37895 transitions. Word has length 105 [2019-12-28 00:28:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:27,729 INFO L462 AbstractCegarLoop]: Abstraction has 16105 states and 37895 transitions. [2019-12-28 00:28:27,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:28:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 16105 states and 37895 transitions. [2019-12-28 00:28:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:28:27,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:27,744 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, 1, 1, 1, 1, 1, 1] [2019-12-28 00:28:27,745 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:27,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash -283821612, now seen corresponding path program 1 times [2019-12-28 00:28:27,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:27,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545532452] [2019-12-28 00:28:27,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:28:27,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545532452] [2019-12-28 00:28:27,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:27,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:28:27,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [570220347] [2019-12-28 00:28:27,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:27,859 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:27,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 209 transitions. [2019-12-28 00:28:27,940 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:27,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:28:27,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:28:27,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:28:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:28:27,942 INFO L87 Difference]: Start difference. First operand 16105 states and 37895 transitions. Second operand 7 states. [2019-12-28 00:28:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:28,467 INFO L93 Difference]: Finished difference Result 17732 states and 41354 transitions. [2019-12-28 00:28:28,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:28:28,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-12-28 00:28:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:28,487 INFO L225 Difference]: With dead ends: 17732 [2019-12-28 00:28:28,487 INFO L226 Difference]: Without dead ends: 17732 [2019-12-28 00:28:28,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:28:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17732 states. [2019-12-28 00:28:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17732 to 15913. [2019-12-28 00:28:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15913 states. [2019-12-28 00:28:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15913 states to 15913 states and 37507 transitions. [2019-12-28 00:28:28,759 INFO L78 Accepts]: Start accepts. Automaton has 15913 states and 37507 transitions. Word has length 105 [2019-12-28 00:28:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:28,759 INFO L462 AbstractCegarLoop]: Abstraction has 15913 states and 37507 transitions. [2019-12-28 00:28:28,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:28:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 15913 states and 37507 transitions. [2019-12-28 00:28:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:28:28,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:28,774 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, 1, 1, 1, 1, 1, 1] [2019-12-28 00:28:28,774 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:28,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:28,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1637589431, now seen corresponding path program 2 times [2019-12-28 00:28:28,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:28,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778920625] [2019-12-28 00:28:28,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:28,928 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:28:28,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778920625] [2019-12-28 00:28:28,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:28,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 00:28:28,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832203894] [2019-12-28 00:28:28,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:28,942 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:29,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 183 states and 251 transitions. [2019-12-28 00:28:29,037 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:29,056 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 00:28:29,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 00:28:29,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:29,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 00:28:29,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:28:29,058 INFO L87 Difference]: Start difference. First operand 15913 states and 37507 transitions. Second operand 9 states. [2019-12-28 00:28:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:29,194 INFO L93 Difference]: Finished difference Result 16246 states and 38231 transitions. [2019-12-28 00:28:29,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:28:29,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-12-28 00:28:29,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:29,199 INFO L225 Difference]: With dead ends: 16246 [2019-12-28 00:28:29,200 INFO L226 Difference]: Without dead ends: 2898 [2019-12-28 00:28:29,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-28 00:28:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2019-12-28 00:28:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2896. [2019-12-28 00:28:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2896 states. [2019-12-28 00:28:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 6855 transitions. [2019-12-28 00:28:29,229 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 6855 transitions. Word has length 105 [2019-12-28 00:28:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:29,230 INFO L462 AbstractCegarLoop]: Abstraction has 2896 states and 6855 transitions. [2019-12-28 00:28:29,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 00:28:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 6855 transitions. [2019-12-28 00:28:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:28:29,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:29,233 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, 1, 1, 1, 1, 1, 1] [2019-12-28 00:28:29,233 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:29,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:29,233 INFO L82 PathProgramCache]: Analyzing trace with hash -582979528, now seen corresponding path program 1 times [2019-12-28 00:28:29,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:29,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925696623] [2019-12-28 00:28:29,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:29,409 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:28:29,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925696623] [2019-12-28 00:28:29,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:29,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-28 00:28:29,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [185109663] [2019-12-28 00:28:29,411 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:29,431 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:29,514 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 201 transitions. [2019-12-28 00:28:29,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:29,652 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:28:29,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-28 00:28:29,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:29,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-28 00:28:29,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-28 00:28:29,653 INFO L87 Difference]: Start difference. First operand 2896 states and 6855 transitions. Second operand 15 states. [2019-12-28 00:28:32,336 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-28 00:28:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:33,439 INFO L93 Difference]: Finished difference Result 5992 states and 13801 transitions. [2019-12-28 00:28:33,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-28 00:28:33,440 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2019-12-28 00:28:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:33,446 INFO L225 Difference]: With dead ends: 5992 [2019-12-28 00:28:33,446 INFO L226 Difference]: Without dead ends: 4651 [2019-12-28 00:28:33,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=291, Invalid=1601, Unknown=0, NotChecked=0, Total=1892 [2019-12-28 00:28:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2019-12-28 00:28:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 2951. [2019-12-28 00:28:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2019-12-28 00:28:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 6916 transitions. [2019-12-28 00:28:33,485 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 6916 transitions. Word has length 105 [2019-12-28 00:28:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:33,485 INFO L462 AbstractCegarLoop]: Abstraction has 2951 states and 6916 transitions. [2019-12-28 00:28:33,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-28 00:28:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 6916 transitions. [2019-12-28 00:28:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:28:33,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:33,488 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, 1, 1, 1, 1, 1, 1] [2019-12-28 00:28:33,488 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash -633160074, now seen corresponding path program 2 times [2019-12-28 00:28:33,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:33,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905050807] [2019-12-28 00:28:33,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 00:28:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 00:28:33,576 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 00:28:33,577 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 00:28:33,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 12:28:33 BasicIcfg [2019-12-28 00:28:33,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 00:28:33,780 INFO L168 Benchmark]: Toolchain (without parser) took 167975.53 ms. Allocated memory was 137.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.3 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 551.6 MB. Max. memory is 7.1 GB. [2019-12-28 00:28:33,784 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.4 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-28 00:28:33,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.19 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 98.9 MB in the beginning and 154.7 MB in the end (delta: -55.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-12-28 00:28:33,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.95 ms. Allocated memory is still 201.3 MB. Free memory was 154.7 MB in the beginning and 151.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-28 00:28:33,785 INFO L168 Benchmark]: Boogie Preprocessor took 41.34 ms. Allocated memory is still 201.3 MB. Free memory was 151.7 MB in the beginning and 148.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-28 00:28:33,786 INFO L168 Benchmark]: RCFGBuilder took 839.05 ms. Allocated memory is still 201.3 MB. Free memory was 148.8 MB in the beginning and 95.9 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2019-12-28 00:28:33,786 INFO L168 Benchmark]: TraceAbstraction took 166289.42 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 95.9 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 484.2 MB. Max. memory is 7.1 GB. [2019-12-28 00:28:33,788 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.18 ms. Allocated memory is still 137.4 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.19 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 98.9 MB in the beginning and 154.7 MB in the end (delta: -55.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.95 ms. Allocated memory is still 201.3 MB. Free memory was 154.7 MB in the beginning and 151.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.34 ms. Allocated memory is still 201.3 MB. Free memory was 151.7 MB in the beginning and 148.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 839.05 ms. Allocated memory is still 201.3 MB. Free memory was 148.8 MB in the beginning and 95.9 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 166289.42 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 95.9 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 484.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 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] [L704] 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] [L705] 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] [L707] 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] [L709] 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 _Bool y$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, y$flush_delayed=0] [L711] 0 int y$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, y$flush_delayed=0, y$mem_tmp=0] [L712] 0 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L713] 0 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L714] 0 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L715] 0 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L716] 0 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L717] 0 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L718] 0 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L719] 0 int *y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L720] 0 int y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L721] 0 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L722] 0 int y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L723] 0 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L726] 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L727] 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t243; 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t243, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t244; 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t244, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 2 y$w_buff1 = y$w_buff0 [L766] 2 y$w_buff0 = 1 [L767] 2 y$w_buff1_used = y$w_buff0_used [L768] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L770] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = (_Bool)1 [L776] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 2 y$flush_delayed = weak$$choice2 [L779] 2 y$mem_tmp = y 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=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__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=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 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=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__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=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L781] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L784] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=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=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L786] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 2 y = y$flush_delayed ? y$mem_tmp : y [L789] 2 y$flush_delayed = (_Bool)0 [L792] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L731] 1 z = 1 [L734] 1 x = 1 [L737] 1 __unbuffered_p0_EAX = x [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 y$flush_delayed = weak$$choice2 [L743] 1 y$mem_tmp = y 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) 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=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) 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=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_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=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) 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=6, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_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=6, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EBX = y 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] EXPR 1 y$flush_delayed ? y$mem_tmp : y 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L758] 1 __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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L833] 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 174 locations, 2 error locations. Result: UNSAFE, OverallTime: 165.8s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 63.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11182 SDtfs, 15937 SDslu, 29788 SDs, 0 SdLazy, 11762 SolverSat, 835 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 133 SyntacticMatches, 14 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222095occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 86.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 245286 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2629 NumberOfCodeBlocks, 2629 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2493 ConstructedInterpolants, 0 QuantifiedInterpolants, 597432 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...