/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:50:29,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:50:29,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:50:29,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:50:29,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:50:29,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:50:29,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:50:29,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:50:29,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:50:29,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:50:29,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:50:29,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:50:29,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:50:29,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:50:29,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:50:29,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:50:29,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:50:29,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:50:29,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:50:29,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:50:29,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:50:29,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:50:29,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:50:29,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:50:29,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:50:29,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:50:29,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:50:29,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:50:29,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:50:29,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:50:29,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:50:29,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:50:29,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:50:29,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:50:29,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:50:29,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:50:29,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:50:29,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:50:29,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:50:29,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:50:29,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:50:29,454 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-SemanticLbe-MCR.epf [2019-12-27 15:50:29,468 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:50:29,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:50:29,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:50:29,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:50:29,470 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:50:29,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:50:29,470 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:50:29,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:50:29,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:50:29,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:50:29,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:50:29,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:50:29,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:50:29,471 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:50:29,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:50:29,472 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:50:29,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:50:29,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:50:29,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:50:29,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:50:29,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:50:29,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:50:29,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:50:29,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:50:29,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:50:29,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:50:29,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:50:29,474 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:50:29,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:50:29,474 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:50:29,474 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:50:29,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:50:29,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:50:29,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:50:29,801 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:50:29,801 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:50:29,804 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_rmo.oepc.i [2019-12-27 15:50:29,882 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f774f072/ce4b66dab7bc4766824f17593d4b7653/FLAG256e00d3c [2019-12-27 15:50:30,431 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:50:30,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_rmo.oepc.i [2019-12-27 15:50:30,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f774f072/ce4b66dab7bc4766824f17593d4b7653/FLAG256e00d3c [2019-12-27 15:50:30,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f774f072/ce4b66dab7bc4766824f17593d4b7653 [2019-12-27 15:50:30,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:50:30,749 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:50:30,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:50:30,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:50:30,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:50:30,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:50:30" (1/1) ... [2019-12-27 15:50:30,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d4032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:30, skipping insertion in model container [2019-12-27 15:50:30,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:50:30" (1/1) ... [2019-12-27 15:50:30,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:50:30,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:50:31,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:50:31,363 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:50:31,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:50:31,508 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:50:31,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:31 WrapperNode [2019-12-27 15:50:31,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:50:31,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:50:31,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:50:31,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:50:31,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:31" (1/1) ... [2019-12-27 15:50:31,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:31" (1/1) ... [2019-12-27 15:50:31,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:50:31,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:50:31,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:50:31,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:50:31,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:31" (1/1) ... [2019-12-27 15:50:31,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:31" (1/1) ... [2019-12-27 15:50:31,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:31" (1/1) ... [2019-12-27 15:50:31,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:31" (1/1) ... [2019-12-27 15:50:31,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:31" (1/1) ... [2019-12-27 15:50:31,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:31" (1/1) ... [2019-12-27 15:50:31,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:31" (1/1) ... [2019-12-27 15:50:31,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:50:31,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:50:31,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:50:31,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:50:31,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:31" (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-27 15:50:31,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:50:31,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:50:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:50:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:50:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:50:31,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:50:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:50:31,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:50:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:50:31,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:50:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:50:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:50:31,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:50:31,700 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:50:32,575 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:50:32,575 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:50:32,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:50:32 BoogieIcfgContainer [2019-12-27 15:50:32,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:50:32,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:50:32,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:50:32,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:50:32,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:50:30" (1/3) ... [2019-12-27 15:50:32,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e885fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:50:32, skipping insertion in model container [2019-12-27 15:50:32,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:31" (2/3) ... [2019-12-27 15:50:32,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e885fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:50:32, skipping insertion in model container [2019-12-27 15:50:32,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:50:32" (3/3) ... [2019-12-27 15:50:32,589 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_rmo.oepc.i [2019-12-27 15:50:32,598 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:50:32,598 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:50:32,605 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:50:32,606 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:50:32,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,651 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,651 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,652 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,653 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,653 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,689 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,690 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,717 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,719 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,727 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,727 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,728 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,734 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,734 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:32,752 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:50:32,772 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:50:32,772 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:50:32,772 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:50:32,772 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:50:32,772 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:50:32,772 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:50:32,772 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:50:32,773 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:50:32,790 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 15:50:32,791 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 15:50:32,913 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 15:50:32,913 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:50:32,929 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:50:32,952 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 15:50:33,026 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 15:50:33,026 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:50:33,034 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:50:33,055 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:50:33,056 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:50:38,075 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 15:50:38,392 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 15:50:38,530 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 15:50:38,574 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91218 [2019-12-27 15:50:38,574 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 15:50:38,578 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-27 15:50:59,696 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 15:50:59,698 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 15:50:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:50:59,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:50:59,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:50:59,704 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:50:59,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:50:59,709 INFO L82 PathProgramCache]: Analyzing trace with hash 921826, now seen corresponding path program 1 times [2019-12-27 15:50:59,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:50:59,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237676215] [2019-12-27 15:50:59,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:50:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:50:59,964 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-27 15:50:59,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237676215] [2019-12-27 15:50:59,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:50:59,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:50:59,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1046889863] [2019-12-27 15:50:59,968 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:50:59,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:50:59,994 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:50:59,995 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:50:59,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:51:00,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:51:00,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:00,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:51:00,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:00,019 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 15:51:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:02,547 INFO L93 Difference]: Finished difference Result 125226 states and 534182 transitions. [2019-12-27 15:51:02,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:51:02,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:51:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:05,813 INFO L225 Difference]: With dead ends: 125226 [2019-12-27 15:51:05,813 INFO L226 Difference]: Without dead ends: 117946 [2019-12-27 15:51:05,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117946 states. [2019-12-27 15:51:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117946 to 117946. [2019-12-27 15:51:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117946 states. [2019-12-27 15:51:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117946 states to 117946 states and 502500 transitions. [2019-12-27 15:51:17,831 INFO L78 Accepts]: Start accepts. Automaton has 117946 states and 502500 transitions. Word has length 3 [2019-12-27 15:51:17,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:17,832 INFO L462 AbstractCegarLoop]: Abstraction has 117946 states and 502500 transitions. [2019-12-27 15:51:17,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:51:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 117946 states and 502500 transitions. [2019-12-27 15:51:17,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:51:17,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:17,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:17,840 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:17,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:17,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2034548154, now seen corresponding path program 1 times [2019-12-27 15:51:17,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:17,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097134118] [2019-12-27 15:51:17,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:17,970 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-27 15:51:17,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097134118] [2019-12-27 15:51:17,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:17,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:51:17,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1364897648] [2019-12-27 15:51:17,971 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:17,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:17,976 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:51:17,976 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:17,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:51:17,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:51:17,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:17,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:51:17,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:51:17,979 INFO L87 Difference]: Start difference. First operand 117946 states and 502500 transitions. Second operand 4 states. [2019-12-27 15:51:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:23,232 INFO L93 Difference]: Finished difference Result 183040 states and 750092 transitions. [2019-12-27 15:51:23,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:51:23,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:51:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:23,859 INFO L225 Difference]: With dead ends: 183040 [2019-12-27 15:51:23,860 INFO L226 Difference]: Without dead ends: 182991 [2019-12-27 15:51:23,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:51:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182991 states. [2019-12-27 15:51:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182991 to 168271. [2019-12-27 15:51:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168271 states. [2019-12-27 15:51:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168271 states to 168271 states and 697811 transitions. [2019-12-27 15:51:35,665 INFO L78 Accepts]: Start accepts. Automaton has 168271 states and 697811 transitions. Word has length 11 [2019-12-27 15:51:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:35,666 INFO L462 AbstractCegarLoop]: Abstraction has 168271 states and 697811 transitions. [2019-12-27 15:51:35,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:51:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 168271 states and 697811 transitions. [2019-12-27 15:51:35,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:51:35,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:35,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:35,673 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:35,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:35,674 INFO L82 PathProgramCache]: Analyzing trace with hash -579003435, now seen corresponding path program 1 times [2019-12-27 15:51:35,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:35,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655507041] [2019-12-27 15:51:35,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:35,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655507041] [2019-12-27 15:51:35,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:35,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:51:35,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [746428330] [2019-12-27 15:51:35,729 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:35,731 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:35,735 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:51:35,736 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:35,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:51:35,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:51:35,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:35,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:51:35,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:35,739 INFO L87 Difference]: Start difference. First operand 168271 states and 697811 transitions. Second operand 3 states. [2019-12-27 15:51:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:35,896 INFO L93 Difference]: Finished difference Result 35531 states and 115505 transitions. [2019-12-27 15:51:35,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:51:35,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:51:35,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:35,954 INFO L225 Difference]: With dead ends: 35531 [2019-12-27 15:51:35,954 INFO L226 Difference]: Without dead ends: 35531 [2019-12-27 15:51:35,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35531 states. [2019-12-27 15:51:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35531 to 35531. [2019-12-27 15:51:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-27 15:51:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 115505 transitions. [2019-12-27 15:51:41,929 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 115505 transitions. Word has length 13 [2019-12-27 15:51:41,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:41,929 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 115505 transitions. [2019-12-27 15:51:41,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:51:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 115505 transitions. [2019-12-27 15:51:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:51:41,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:41,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:41,933 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:41,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1458626840, now seen corresponding path program 1 times [2019-12-27 15:51:41,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:41,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878624504] [2019-12-27 15:51:41,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:42,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878624504] [2019-12-27 15:51:42,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:42,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:51:42,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1481837331] [2019-12-27 15:51:42,023 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:42,025 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:42,028 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:51:42,028 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:42,028 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:51:42,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:51:42,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:42,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:51:42,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:51:42,029 INFO L87 Difference]: Start difference. First operand 35531 states and 115505 transitions. Second operand 5 states. [2019-12-27 15:51:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:42,619 INFO L93 Difference]: Finished difference Result 49606 states and 159424 transitions. [2019-12-27 15:51:42,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:51:42,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 15:51:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:42,702 INFO L225 Difference]: With dead ends: 49606 [2019-12-27 15:51:42,703 INFO L226 Difference]: Without dead ends: 49606 [2019-12-27 15:51:42,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:51:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49606 states. [2019-12-27 15:51:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49606 to 42335. [2019-12-27 15:51:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42335 states. [2019-12-27 15:51:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42335 states to 42335 states and 137188 transitions. [2019-12-27 15:51:43,777 INFO L78 Accepts]: Start accepts. Automaton has 42335 states and 137188 transitions. Word has length 16 [2019-12-27 15:51:43,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:43,778 INFO L462 AbstractCegarLoop]: Abstraction has 42335 states and 137188 transitions. [2019-12-27 15:51:43,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:51:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 42335 states and 137188 transitions. [2019-12-27 15:51:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:51:43,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:43,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:43,790 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:43,791 INFO L82 PathProgramCache]: Analyzing trace with hash -311730194, now seen corresponding path program 1 times [2019-12-27 15:51:43,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:43,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5161978] [2019-12-27 15:51:43,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:43,939 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-27 15:51:43,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5161978] [2019-12-27 15:51:43,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:43,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:51:43,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1450715107] [2019-12-27 15:51:43,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:43,943 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:43,952 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 15:51:43,952 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:43,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:51:44,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:51:44,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:51:44,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:44,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:51:44,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:51:44,041 INFO L87 Difference]: Start difference. First operand 42335 states and 137188 transitions. Second operand 9 states. [2019-12-27 15:51:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:45,387 INFO L93 Difference]: Finished difference Result 68217 states and 214442 transitions. [2019-12-27 15:51:45,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 15:51:45,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 15:51:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:45,501 INFO L225 Difference]: With dead ends: 68217 [2019-12-27 15:51:45,501 INFO L226 Difference]: Without dead ends: 68203 [2019-12-27 15:51:45,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:51:45,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-12-27 15:51:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 42009. [2019-12-27 15:51:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42009 states. [2019-12-27 15:51:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42009 states to 42009 states and 135594 transitions. [2019-12-27 15:51:46,856 INFO L78 Accepts]: Start accepts. Automaton has 42009 states and 135594 transitions. Word has length 22 [2019-12-27 15:51:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:46,857 INFO L462 AbstractCegarLoop]: Abstraction has 42009 states and 135594 transitions. [2019-12-27 15:51:46,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:51:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 42009 states and 135594 transitions. [2019-12-27 15:51:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:51:46,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:46,873 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] [2019-12-27 15:51:46,873 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:46,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:46,874 INFO L82 PathProgramCache]: Analyzing trace with hash 573582081, now seen corresponding path program 1 times [2019-12-27 15:51:46,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:46,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018848999] [2019-12-27 15:51:46,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:46,930 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-27 15:51:46,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018848999] [2019-12-27 15:51:46,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:46,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:51:46,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2128943894] [2019-12-27 15:51:46,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:46,935 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:46,946 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:51:46,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:46,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:51:46,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:51:46,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:46,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:51:46,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:51:46,966 INFO L87 Difference]: Start difference. First operand 42009 states and 135594 transitions. Second operand 5 states. [2019-12-27 15:51:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:47,040 INFO L93 Difference]: Finished difference Result 16636 states and 50803 transitions. [2019-12-27 15:51:47,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:51:47,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 15:51:47,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:47,073 INFO L225 Difference]: With dead ends: 16636 [2019-12-27 15:51:47,073 INFO L226 Difference]: Without dead ends: 16636 [2019-12-27 15:51:47,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:51:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2019-12-27 15:51:47,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 16378. [2019-12-27 15:51:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16378 states. [2019-12-27 15:51:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16378 states to 16378 states and 50067 transitions. [2019-12-27 15:51:47,351 INFO L78 Accepts]: Start accepts. Automaton has 16378 states and 50067 transitions. Word has length 25 [2019-12-27 15:51:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:47,351 INFO L462 AbstractCegarLoop]: Abstraction has 16378 states and 50067 transitions. [2019-12-27 15:51:47,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:51:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 16378 states and 50067 transitions. [2019-12-27 15:51:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:51:47,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:47,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:47,364 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:47,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash 574668024, now seen corresponding path program 1 times [2019-12-27 15:51:47,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:47,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168124056] [2019-12-27 15:51:47,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:47,450 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-27 15:51:47,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168124056] [2019-12-27 15:51:47,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:47,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:51:47,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2030023596] [2019-12-27 15:51:47,451 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:47,456 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:47,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:51:47,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:47,462 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:51:47,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:51:47,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:47,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:51:47,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:51:47,463 INFO L87 Difference]: Start difference. First operand 16378 states and 50067 transitions. Second operand 6 states. [2019-12-27 15:51:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:47,981 INFO L93 Difference]: Finished difference Result 23754 states and 70239 transitions. [2019-12-27 15:51:47,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:51:47,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 15:51:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:48,015 INFO L225 Difference]: With dead ends: 23754 [2019-12-27 15:51:48,015 INFO L226 Difference]: Without dead ends: 23754 [2019-12-27 15:51:48,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:51:48,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2019-12-27 15:51:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 19127. [2019-12-27 15:51:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19127 states. [2019-12-27 15:51:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19127 states to 19127 states and 57723 transitions. [2019-12-27 15:51:48,667 INFO L78 Accepts]: Start accepts. Automaton has 19127 states and 57723 transitions. Word has length 27 [2019-12-27 15:51:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:48,668 INFO L462 AbstractCegarLoop]: Abstraction has 19127 states and 57723 transitions. [2019-12-27 15:51:48,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:51:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 19127 states and 57723 transitions. [2019-12-27 15:51:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:51:48,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:48,689 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] [2019-12-27 15:51:48,689 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:48,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:48,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1393723506, now seen corresponding path program 1 times [2019-12-27 15:51:48,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:48,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875336910] [2019-12-27 15:51:48,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:48,781 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-27 15:51:48,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875336910] [2019-12-27 15:51:48,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:48,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:51:48,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [847591660] [2019-12-27 15:51:48,782 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:48,793 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:48,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 74 transitions. [2019-12-27 15:51:48,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:48,834 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:51:48,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:51:48,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:48,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:51:48,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:51:48,835 INFO L87 Difference]: Start difference. First operand 19127 states and 57723 transitions. Second operand 6 states. [2019-12-27 15:51:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:49,327 INFO L93 Difference]: Finished difference Result 23902 states and 71215 transitions. [2019-12-27 15:51:49,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:51:49,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 15:51:49,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:49,361 INFO L225 Difference]: With dead ends: 23902 [2019-12-27 15:51:49,361 INFO L226 Difference]: Without dead ends: 23902 [2019-12-27 15:51:49,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:51:49,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23902 states. [2019-12-27 15:51:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23902 to 20179. [2019-12-27 15:51:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20179 states. [2019-12-27 15:51:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20179 states to 20179 states and 61180 transitions. [2019-12-27 15:51:49,676 INFO L78 Accepts]: Start accepts. Automaton has 20179 states and 61180 transitions. Word has length 33 [2019-12-27 15:51:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:49,677 INFO L462 AbstractCegarLoop]: Abstraction has 20179 states and 61180 transitions. [2019-12-27 15:51:49,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:51:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 20179 states and 61180 transitions. [2019-12-27 15:51:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:51:49,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:49,700 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] [2019-12-27 15:51:49,700 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:49,701 INFO L82 PathProgramCache]: Analyzing trace with hash 305072172, now seen corresponding path program 2 times [2019-12-27 15:51:49,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:49,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291399977] [2019-12-27 15:51:49,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:49,808 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-27 15:51:49,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291399977] [2019-12-27 15:51:49,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:49,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:51:49,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1970315733] [2019-12-27 15:51:49,809 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:49,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:49,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 15:51:49,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:49,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:51:49,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:51:49,930 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:51:49,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:51:49,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:49,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:51:49,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:51:49,932 INFO L87 Difference]: Start difference. First operand 20179 states and 61180 transitions. Second operand 11 states. [2019-12-27 15:51:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:51,659 INFO L93 Difference]: Finished difference Result 37996 states and 112910 transitions. [2019-12-27 15:51:51,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:51:51,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-12-27 15:51:51,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:51,713 INFO L225 Difference]: With dead ends: 37996 [2019-12-27 15:51:51,713 INFO L226 Difference]: Without dead ends: 37996 [2019-12-27 15:51:51,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:51:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37996 states. [2019-12-27 15:51:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37996 to 20600. [2019-12-27 15:51:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20600 states. [2019-12-27 15:51:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20600 states to 20600 states and 62975 transitions. [2019-12-27 15:51:52,425 INFO L78 Accepts]: Start accepts. Automaton has 20600 states and 62975 transitions. Word has length 33 [2019-12-27 15:51:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:52,425 INFO L462 AbstractCegarLoop]: Abstraction has 20600 states and 62975 transitions. [2019-12-27 15:51:52,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:51:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 20600 states and 62975 transitions. [2019-12-27 15:51:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:51:52,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:52,452 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] [2019-12-27 15:51:52,452 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:52,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1779229683, now seen corresponding path program 1 times [2019-12-27 15:51:52,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:52,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008494111] [2019-12-27 15:51:52,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:52,541 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-27 15:51:52,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008494111] [2019-12-27 15:51:52,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:52,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:51:52,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [858453303] [2019-12-27 15:51:52,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:52,549 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:52,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 296 transitions. [2019-12-27 15:51:52,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:52,609 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:51:52,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:51:52,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:52,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:51:52,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:52,610 INFO L87 Difference]: Start difference. First operand 20600 states and 62975 transitions. Second operand 3 states. [2019-12-27 15:51:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:52,715 INFO L93 Difference]: Finished difference Result 20599 states and 62973 transitions. [2019-12-27 15:51:52,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:51:52,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:51:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:52,759 INFO L225 Difference]: With dead ends: 20599 [2019-12-27 15:51:52,760 INFO L226 Difference]: Without dead ends: 20599 [2019-12-27 15:51:52,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20599 states. [2019-12-27 15:51:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20599 to 20599. [2019-12-27 15:51:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20599 states. [2019-12-27 15:51:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20599 states to 20599 states and 62973 transitions. [2019-12-27 15:51:53,237 INFO L78 Accepts]: Start accepts. Automaton has 20599 states and 62973 transitions. Word has length 39 [2019-12-27 15:51:53,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:53,237 INFO L462 AbstractCegarLoop]: Abstraction has 20599 states and 62973 transitions. [2019-12-27 15:51:53,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:51:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 20599 states and 62973 transitions. [2019-12-27 15:51:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:51:53,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:53,270 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] [2019-12-27 15:51:53,270 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:53,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1175786798, now seen corresponding path program 1 times [2019-12-27 15:51:53,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:53,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393548231] [2019-12-27 15:51:53,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:53,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393548231] [2019-12-27 15:51:53,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:53,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:51:53,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [309205428] [2019-12-27 15:51:53,398 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:53,406 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:53,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 358 transitions. [2019-12-27 15:51:53,474 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:53,671 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 15:51:53,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:51:53,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:53,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:51:53,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:51:53,673 INFO L87 Difference]: Start difference. First operand 20599 states and 62973 transitions. Second operand 11 states. [2019-12-27 15:51:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:56,322 INFO L93 Difference]: Finished difference Result 76331 states and 229097 transitions. [2019-12-27 15:51:56,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 15:51:56,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-12-27 15:51:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:56,442 INFO L225 Difference]: With dead ends: 76331 [2019-12-27 15:51:56,443 INFO L226 Difference]: Without dead ends: 76331 [2019-12-27 15:51:56,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:51:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76331 states. [2019-12-27 15:51:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76331 to 26089. [2019-12-27 15:51:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26089 states. [2019-12-27 15:51:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26089 states to 26089 states and 80005 transitions. [2019-12-27 15:51:57,158 INFO L78 Accepts]: Start accepts. Automaton has 26089 states and 80005 transitions. Word has length 40 [2019-12-27 15:51:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:57,158 INFO L462 AbstractCegarLoop]: Abstraction has 26089 states and 80005 transitions. [2019-12-27 15:51:57,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:51:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 26089 states and 80005 transitions. [2019-12-27 15:51:57,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:51:57,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:57,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:57,186 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:57,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:57,186 INFO L82 PathProgramCache]: Analyzing trace with hash -93454286, now seen corresponding path program 2 times [2019-12-27 15:51:57,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:57,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651572712] [2019-12-27 15:51:57,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:57,274 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-27 15:51:57,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651572712] [2019-12-27 15:51:57,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:57,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:51:57,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1725716215] [2019-12-27 15:51:57,275 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:57,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:57,336 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 404 transitions. [2019-12-27 15:51:57,336 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:57,357 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:51:57,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:51:57,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:57,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:51:57,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:51:57,358 INFO L87 Difference]: Start difference. First operand 26089 states and 80005 transitions. Second operand 6 states. [2019-12-27 15:51:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:58,218 INFO L93 Difference]: Finished difference Result 36507 states and 111194 transitions. [2019-12-27 15:51:58,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:51:58,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 15:51:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:58,271 INFO L225 Difference]: With dead ends: 36507 [2019-12-27 15:51:58,271 INFO L226 Difference]: Without dead ends: 36507 [2019-12-27 15:51:58,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:51:58,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36507 states. [2019-12-27 15:51:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36507 to 31861. [2019-12-27 15:51:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31861 states. [2019-12-27 15:51:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31861 states to 31861 states and 98004 transitions. [2019-12-27 15:51:59,042 INFO L78 Accepts]: Start accepts. Automaton has 31861 states and 98004 transitions. Word has length 40 [2019-12-27 15:51:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:59,042 INFO L462 AbstractCegarLoop]: Abstraction has 31861 states and 98004 transitions. [2019-12-27 15:51:59,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:51:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 31861 states and 98004 transitions. [2019-12-27 15:51:59,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:51:59,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:59,081 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] [2019-12-27 15:51:59,081 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:59,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:59,082 INFO L82 PathProgramCache]: Analyzing trace with hash 152430908, now seen corresponding path program 3 times [2019-12-27 15:51:59,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:59,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020031071] [2019-12-27 15:51:59,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:59,139 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-27 15:51:59,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020031071] [2019-12-27 15:51:59,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:59,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:51:59,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050656975] [2019-12-27 15:51:59,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:59,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:59,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 15:51:59,239 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:59,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 15:51:59,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:51:59,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:59,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:51:59,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:51:59,275 INFO L87 Difference]: Start difference. First operand 31861 states and 98004 transitions. Second operand 7 states. [2019-12-27 15:51:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:59,439 INFO L93 Difference]: Finished difference Result 30285 states and 94325 transitions. [2019-12-27 15:51:59,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:51:59,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 15:51:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:59,495 INFO L225 Difference]: With dead ends: 30285 [2019-12-27 15:51:59,495 INFO L226 Difference]: Without dead ends: 30285 [2019-12-27 15:51:59,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:51:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30285 states. [2019-12-27 15:51:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30285 to 29133. [2019-12-27 15:51:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29133 states. [2019-12-27 15:51:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29133 states to 29133 states and 91216 transitions. [2019-12-27 15:51:59,988 INFO L78 Accepts]: Start accepts. Automaton has 29133 states and 91216 transitions. Word has length 40 [2019-12-27 15:51:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:59,988 INFO L462 AbstractCegarLoop]: Abstraction has 29133 states and 91216 transitions. [2019-12-27 15:51:59,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:51:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 29133 states and 91216 transitions. [2019-12-27 15:52:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:52:00,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:00,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:00,021 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash 8761726, now seen corresponding path program 1 times [2019-12-27 15:52:00,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:00,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947994346] [2019-12-27 15:52:00,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:00,072 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-27 15:52:00,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947994346] [2019-12-27 15:52:00,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:00,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:52:00,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2113650832] [2019-12-27 15:52:00,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:00,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:00,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 286 states and 514 transitions. [2019-12-27 15:52:00,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:00,689 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:52:00,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:52:00,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:00,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:52:00,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:52:00,690 INFO L87 Difference]: Start difference. First operand 29133 states and 91216 transitions. Second operand 3 states. [2019-12-27 15:52:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:00,837 INFO L93 Difference]: Finished difference Result 37246 states and 115086 transitions. [2019-12-27 15:52:00,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:52:00,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:52:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:00,889 INFO L225 Difference]: With dead ends: 37246 [2019-12-27 15:52:00,889 INFO L226 Difference]: Without dead ends: 37246 [2019-12-27 15:52:00,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:52:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37246 states. [2019-12-27 15:52:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37246 to 27242. [2019-12-27 15:52:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27242 states. [2019-12-27 15:52:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27242 states to 27242 states and 84793 transitions. [2019-12-27 15:52:01,377 INFO L78 Accepts]: Start accepts. Automaton has 27242 states and 84793 transitions. Word has length 64 [2019-12-27 15:52:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:01,377 INFO L462 AbstractCegarLoop]: Abstraction has 27242 states and 84793 transitions. [2019-12-27 15:52:01,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:52:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 27242 states and 84793 transitions. [2019-12-27 15:52:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:52:01,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:01,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:01,405 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:01,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1487362447, now seen corresponding path program 1 times [2019-12-27 15:52:01,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:01,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545060498] [2019-12-27 15:52:01,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:01,503 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-27 15:52:01,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545060498] [2019-12-27 15:52:01,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:01,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:52:01,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1643485286] [2019-12-27 15:52:01,504 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:01,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:01,768 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 286 states and 514 transitions. [2019-12-27 15:52:01,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:01,863 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 15:52:01,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:52:01,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:01,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:52:01,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:52:01,865 INFO L87 Difference]: Start difference. First operand 27242 states and 84793 transitions. Second operand 9 states. [2019-12-27 15:52:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:04,389 INFO L93 Difference]: Finished difference Result 102455 states and 313287 transitions. [2019-12-27 15:52:04,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 15:52:04,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 15:52:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:04,518 INFO L225 Difference]: With dead ends: 102455 [2019-12-27 15:52:04,519 INFO L226 Difference]: Without dead ends: 77192 [2019-12-27 15:52:04,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:52:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77192 states. [2019-12-27 15:52:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77192 to 31602. [2019-12-27 15:52:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31602 states. [2019-12-27 15:52:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31602 states to 31602 states and 98387 transitions. [2019-12-27 15:52:05,401 INFO L78 Accepts]: Start accepts. Automaton has 31602 states and 98387 transitions. Word has length 64 [2019-12-27 15:52:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:05,402 INFO L462 AbstractCegarLoop]: Abstraction has 31602 states and 98387 transitions. [2019-12-27 15:52:05,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:52:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 31602 states and 98387 transitions. [2019-12-27 15:52:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:52:05,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:05,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:05,435 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:05,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:05,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1007546921, now seen corresponding path program 2 times [2019-12-27 15:52:05,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:05,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264786893] [2019-12-27 15:52:05,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:05,532 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-27 15:52:05,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264786893] [2019-12-27 15:52:05,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:05,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:52:05,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379881505] [2019-12-27 15:52:05,534 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:05,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:06,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 286 states and 547 transitions. [2019-12-27 15:52:06,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:06,243 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:52:06,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:52:06,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:06,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:52:06,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:52:06,245 INFO L87 Difference]: Start difference. First operand 31602 states and 98387 transitions. Second operand 7 states. [2019-12-27 15:52:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:06,781 INFO L93 Difference]: Finished difference Result 81455 states and 249397 transitions. [2019-12-27 15:52:06,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:52:06,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 15:52:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:06,870 INFO L225 Difference]: With dead ends: 81455 [2019-12-27 15:52:06,870 INFO L226 Difference]: Without dead ends: 57810 [2019-12-27 15:52:06,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:52:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57810 states. [2019-12-27 15:52:07,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57810 to 35472. [2019-12-27 15:52:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35472 states. [2019-12-27 15:52:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35472 states to 35472 states and 110059 transitions. [2019-12-27 15:52:07,594 INFO L78 Accepts]: Start accepts. Automaton has 35472 states and 110059 transitions. Word has length 64 [2019-12-27 15:52:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:07,594 INFO L462 AbstractCegarLoop]: Abstraction has 35472 states and 110059 transitions. [2019-12-27 15:52:07,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:52:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 35472 states and 110059 transitions. [2019-12-27 15:52:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:52:07,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:07,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:07,637 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:07,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1228276157, now seen corresponding path program 3 times [2019-12-27 15:52:07,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:07,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425447588] [2019-12-27 15:52:07,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:07,741 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-27 15:52:07,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425447588] [2019-12-27 15:52:07,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:07,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:52:07,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1032386948] [2019-12-27 15:52:07,742 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:07,764 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:08,341 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 433 transitions. [2019-12-27 15:52:08,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:08,386 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:52:08,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:52:08,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:08,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:52:08,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:52:08,388 INFO L87 Difference]: Start difference. First operand 35472 states and 110059 transitions. Second operand 8 states. [2019-12-27 15:52:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:09,569 INFO L93 Difference]: Finished difference Result 100376 states and 308903 transitions. [2019-12-27 15:52:09,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 15:52:09,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 15:52:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:09,724 INFO L225 Difference]: With dead ends: 100376 [2019-12-27 15:52:09,724 INFO L226 Difference]: Without dead ends: 89606 [2019-12-27 15:52:09,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:52:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89606 states. [2019-12-27 15:52:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89606 to 35918. [2019-12-27 15:52:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35918 states. [2019-12-27 15:52:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35918 states to 35918 states and 111803 transitions. [2019-12-27 15:52:10,762 INFO L78 Accepts]: Start accepts. Automaton has 35918 states and 111803 transitions. Word has length 64 [2019-12-27 15:52:10,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:10,762 INFO L462 AbstractCegarLoop]: Abstraction has 35918 states and 111803 transitions. [2019-12-27 15:52:10,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:52:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 35918 states and 111803 transitions. [2019-12-27 15:52:10,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:52:10,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:10,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:10,802 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:10,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2056816817, now seen corresponding path program 4 times [2019-12-27 15:52:10,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:10,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128911537] [2019-12-27 15:52:10,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:10,917 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-27 15:52:10,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128911537] [2019-12-27 15:52:10,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:10,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:52:10,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [730721049] [2019-12-27 15:52:10,918 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:10,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:11,443 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 382 transitions. [2019-12-27 15:52:11,443 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:11,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:52:11,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:52:11,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:11,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:52:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:52:11,548 INFO L87 Difference]: Start difference. First operand 35918 states and 111803 transitions. Second operand 11 states. [2019-12-27 15:52:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:14,538 INFO L93 Difference]: Finished difference Result 146852 states and 447287 transitions. [2019-12-27 15:52:14,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 15:52:14,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 15:52:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:14,743 INFO L225 Difference]: With dead ends: 146852 [2019-12-27 15:52:14,744 INFO L226 Difference]: Without dead ends: 131648 [2019-12-27 15:52:14,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=569, Invalid=2083, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 15:52:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131648 states. [2019-12-27 15:52:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131648 to 35991. [2019-12-27 15:52:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35991 states. [2019-12-27 15:52:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35991 states to 35991 states and 112122 transitions. [2019-12-27 15:52:16,547 INFO L78 Accepts]: Start accepts. Automaton has 35991 states and 112122 transitions. Word has length 64 [2019-12-27 15:52:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:16,548 INFO L462 AbstractCegarLoop]: Abstraction has 35991 states and 112122 transitions. [2019-12-27 15:52:16,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:52:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 35991 states and 112122 transitions. [2019-12-27 15:52:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:52:16,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:16,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:16,586 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash -17789391, now seen corresponding path program 5 times [2019-12-27 15:52:16,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:16,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529681222] [2019-12-27 15:52:16,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:16,650 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-27 15:52:16,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529681222] [2019-12-27 15:52:16,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:16,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:52:16,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1524740264] [2019-12-27 15:52:16,652 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:16,671 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:16,866 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 250 states and 432 transitions. [2019-12-27 15:52:16,866 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:16,867 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:52:16,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:52:16,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:16,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:52:16,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:52:16,868 INFO L87 Difference]: Start difference. First operand 35991 states and 112122 transitions. Second operand 3 states. [2019-12-27 15:52:17,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:17,050 INFO L93 Difference]: Finished difference Result 42761 states and 132453 transitions. [2019-12-27 15:52:17,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:52:17,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:52:17,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:17,109 INFO L225 Difference]: With dead ends: 42761 [2019-12-27 15:52:17,109 INFO L226 Difference]: Without dead ends: 42761 [2019-12-27 15:52:17,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-27 15:52:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42761 states. [2019-12-27 15:52:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42761 to 37261. [2019-12-27 15:52:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37261 states. [2019-12-27 15:52:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37261 states to 37261 states and 116146 transitions. [2019-12-27 15:52:18,136 INFO L78 Accepts]: Start accepts. Automaton has 37261 states and 116146 transitions. Word has length 64 [2019-12-27 15:52:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:18,136 INFO L462 AbstractCegarLoop]: Abstraction has 37261 states and 116146 transitions. [2019-12-27 15:52:18,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:52:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 37261 states and 116146 transitions. [2019-12-27 15:52:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:18,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:18,175 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] [2019-12-27 15:52:18,175 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:18,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:18,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1046831716, now seen corresponding path program 1 times [2019-12-27 15:52:18,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:18,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90656489] [2019-12-27 15:52:18,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:18,279 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-27 15:52:18,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90656489] [2019-12-27 15:52:18,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:18,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:52:18,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [422412112] [2019-12-27 15:52:18,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:18,301 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:18,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 240 states and 451 transitions. [2019-12-27 15:52:18,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:18,576 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:52:18,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:52:18,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:18,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:52:18,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:52:18,577 INFO L87 Difference]: Start difference. First operand 37261 states and 116146 transitions. Second operand 8 states. [2019-12-27 15:52:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:19,826 INFO L93 Difference]: Finished difference Result 113442 states and 345656 transitions. [2019-12-27 15:52:19,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 15:52:19,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 15:52:19,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:19,987 INFO L225 Difference]: With dead ends: 113442 [2019-12-27 15:52:19,988 INFO L226 Difference]: Without dead ends: 101309 [2019-12-27 15:52:19,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:52:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101309 states. [2019-12-27 15:52:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101309 to 37263. [2019-12-27 15:52:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37263 states. [2019-12-27 15:52:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37263 states to 37263 states and 116161 transitions. [2019-12-27 15:52:21,577 INFO L78 Accepts]: Start accepts. Automaton has 37263 states and 116161 transitions. Word has length 65 [2019-12-27 15:52:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:21,577 INFO L462 AbstractCegarLoop]: Abstraction has 37263 states and 116161 transitions. [2019-12-27 15:52:21,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:52:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 37263 states and 116161 transitions. [2019-12-27 15:52:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:21,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:21,617 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] [2019-12-27 15:52:21,618 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:21,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:21,618 INFO L82 PathProgramCache]: Analyzing trace with hash 501635668, now seen corresponding path program 2 times [2019-12-27 15:52:21,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:21,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769568515] [2019-12-27 15:52:21,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:21,719 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-27 15:52:21,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769568515] [2019-12-27 15:52:21,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:21,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:52:21,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1212097550] [2019-12-27 15:52:21,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:21,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:22,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 348 transitions. [2019-12-27 15:52:22,040 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:22,441 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 15:52:22,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:52:22,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:22,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:52:22,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:52:22,442 INFO L87 Difference]: Start difference. First operand 37263 states and 116161 transitions. Second operand 12 states. [2019-12-27 15:52:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:28,945 INFO L93 Difference]: Finished difference Result 190788 states and 580742 transitions. [2019-12-27 15:52:28,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-12-27 15:52:28,946 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 15:52:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:29,184 INFO L225 Difference]: With dead ends: 190788 [2019-12-27 15:52:29,184 INFO L226 Difference]: Without dead ends: 157366 [2019-12-27 15:52:29,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=870, Invalid=3822, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 15:52:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157366 states. [2019-12-27 15:52:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157366 to 40689. [2019-12-27 15:52:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40689 states. [2019-12-27 15:52:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40689 states to 40689 states and 127368 transitions. [2019-12-27 15:52:30,753 INFO L78 Accepts]: Start accepts. Automaton has 40689 states and 127368 transitions. Word has length 65 [2019-12-27 15:52:30,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:30,753 INFO L462 AbstractCegarLoop]: Abstraction has 40689 states and 127368 transitions. [2019-12-27 15:52:30,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:52:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 40689 states and 127368 transitions. [2019-12-27 15:52:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:30,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:30,797 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] [2019-12-27 15:52:30,797 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:30,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:30,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1049644216, now seen corresponding path program 3 times [2019-12-27 15:52:30,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:30,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950706574] [2019-12-27 15:52:30,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:30,918 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-27 15:52:30,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950706574] [2019-12-27 15:52:30,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:30,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:52:30,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [361228528] [2019-12-27 15:52:30,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:30,942 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:31,680 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 388 transitions. [2019-12-27 15:52:31,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:31,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:52:31,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:52:31,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:31,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:52:31,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:52:31,786 INFO L87 Difference]: Start difference. First operand 40689 states and 127368 transitions. Second operand 9 states. [2019-12-27 15:52:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:33,807 INFO L93 Difference]: Finished difference Result 160410 states and 489471 transitions. [2019-12-27 15:52:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 15:52:33,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:52:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:34,028 INFO L225 Difference]: With dead ends: 160410 [2019-12-27 15:52:34,029 INFO L226 Difference]: Without dead ends: 132271 [2019-12-27 15:52:34,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-27 15:52:34,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132271 states. [2019-12-27 15:52:35,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132271 to 43049. [2019-12-27 15:52:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43049 states. [2019-12-27 15:52:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43049 states to 43049 states and 134585 transitions. [2019-12-27 15:52:35,880 INFO L78 Accepts]: Start accepts. Automaton has 43049 states and 134585 transitions. Word has length 65 [2019-12-27 15:52:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:35,880 INFO L462 AbstractCegarLoop]: Abstraction has 43049 states and 134585 transitions. [2019-12-27 15:52:35,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:52:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 43049 states and 134585 transitions. [2019-12-27 15:52:35,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:35,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:35,925 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] [2019-12-27 15:52:35,925 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:35,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1980366454, now seen corresponding path program 4 times [2019-12-27 15:52:35,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:35,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514031314] [2019-12-27 15:52:35,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:36,038 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-27 15:52:36,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514031314] [2019-12-27 15:52:36,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:36,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:52:36,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [338020539] [2019-12-27 15:52:36,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:36,057 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:36,325 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 438 transitions. [2019-12-27 15:52:36,326 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:36,412 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:52:36,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:52:36,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:36,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:52:36,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:52:36,413 INFO L87 Difference]: Start difference. First operand 43049 states and 134585 transitions. Second operand 8 states. [2019-12-27 15:52:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:38,163 INFO L93 Difference]: Finished difference Result 64678 states and 198664 transitions. [2019-12-27 15:52:38,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:52:38,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 15:52:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:38,263 INFO L225 Difference]: With dead ends: 64678 [2019-12-27 15:52:38,263 INFO L226 Difference]: Without dead ends: 64678 [2019-12-27 15:52:38,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:52:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64678 states. [2019-12-27 15:52:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64678 to 45455. [2019-12-27 15:52:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45455 states. [2019-12-27 15:52:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45455 states to 45455 states and 141332 transitions. [2019-12-27 15:52:39,686 INFO L78 Accepts]: Start accepts. Automaton has 45455 states and 141332 transitions. Word has length 65 [2019-12-27 15:52:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:39,686 INFO L462 AbstractCegarLoop]: Abstraction has 45455 states and 141332 transitions. [2019-12-27 15:52:39,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:52:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 45455 states and 141332 transitions. [2019-12-27 15:52:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:39,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:39,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:52:39,737 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:39,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:39,738 INFO L82 PathProgramCache]: Analyzing trace with hash -25014344, now seen corresponding path program 5 times [2019-12-27 15:52:39,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:39,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254795517] [2019-12-27 15:52:39,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:39,870 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-27 15:52:39,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254795517] [2019-12-27 15:52:39,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:39,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:52:39,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [908527477] [2019-12-27 15:52:39,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:39,889 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:40,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 412 transitions. [2019-12-27 15:52:40,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:40,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 15:52:40,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:52:40,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:40,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:52:40,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:52:40,213 INFO L87 Difference]: Start difference. First operand 45455 states and 141332 transitions. Second operand 11 states. [2019-12-27 15:52:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:44,025 INFO L93 Difference]: Finished difference Result 97977 states and 299334 transitions. [2019-12-27 15:52:44,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 15:52:44,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 15:52:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:44,193 INFO L225 Difference]: With dead ends: 97977 [2019-12-27 15:52:44,194 INFO L226 Difference]: Without dead ends: 97977 [2019-12-27 15:52:44,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=415, Invalid=1477, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 15:52:44,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97977 states. [2019-12-27 15:52:45,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97977 to 44874. [2019-12-27 15:52:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44874 states. [2019-12-27 15:52:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44874 states to 44874 states and 139728 transitions. [2019-12-27 15:52:45,688 INFO L78 Accepts]: Start accepts. Automaton has 44874 states and 139728 transitions. Word has length 65 [2019-12-27 15:52:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:45,688 INFO L462 AbstractCegarLoop]: Abstraction has 44874 states and 139728 transitions. [2019-12-27 15:52:45,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:52:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 44874 states and 139728 transitions. [2019-12-27 15:52:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:45,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:45,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:52:45,737 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:45,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:45,738 INFO L82 PathProgramCache]: Analyzing trace with hash 373916454, now seen corresponding path program 1 times [2019-12-27 15:52:45,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:45,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277090663] [2019-12-27 15:52:45,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:45,800 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-27 15:52:45,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277090663] [2019-12-27 15:52:45,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:45,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:52:45,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1801644867] [2019-12-27 15:52:45,801 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:45,818 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:46,043 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 438 transitions. [2019-12-27 15:52:46,043 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:46,044 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:52:46,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:52:46,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:46,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:52:46,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:52:46,044 INFO L87 Difference]: Start difference. First operand 44874 states and 139728 transitions. Second operand 3 states. [2019-12-27 15:52:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:46,184 INFO L93 Difference]: Finished difference Result 44873 states and 139726 transitions. [2019-12-27 15:52:46,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:52:46,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:52:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:46,253 INFO L225 Difference]: With dead ends: 44873 [2019-12-27 15:52:46,253 INFO L226 Difference]: Without dead ends: 44873 [2019-12-27 15:52:46,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:52:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44873 states. [2019-12-27 15:52:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44873 to 35658. [2019-12-27 15:52:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35658 states. [2019-12-27 15:52:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35658 states to 35658 states and 113524 transitions. [2019-12-27 15:52:46,959 INFO L78 Accepts]: Start accepts. Automaton has 35658 states and 113524 transitions. Word has length 65 [2019-12-27 15:52:46,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:46,959 INFO L462 AbstractCegarLoop]: Abstraction has 35658 states and 113524 transitions. [2019-12-27 15:52:46,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:52:46,959 INFO L276 IsEmpty]: Start isEmpty. Operand 35658 states and 113524 transitions. [2019-12-27 15:52:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:52:46,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:46,999 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-27 15:52:46,999 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:47,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:47,000 INFO L82 PathProgramCache]: Analyzing trace with hash 392067852, now seen corresponding path program 1 times [2019-12-27 15:52:47,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:47,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198241589] [2019-12-27 15:52:47,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:47,059 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-27 15:52:47,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198241589] [2019-12-27 15:52:47,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:47,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:52:47,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751626742] [2019-12-27 15:52:47,060 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:47,077 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:47,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 348 transitions. [2019-12-27 15:52:47,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:47,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:52:47,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:52:47,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:47,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:52:47,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:52:47,257 INFO L87 Difference]: Start difference. First operand 35658 states and 113524 transitions. Second operand 4 states. [2019-12-27 15:52:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:47,774 INFO L93 Difference]: Finished difference Result 37942 states and 117304 transitions. [2019-12-27 15:52:47,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:52:47,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:52:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:47,827 INFO L225 Difference]: With dead ends: 37942 [2019-12-27 15:52:47,827 INFO L226 Difference]: Without dead ends: 37942 [2019-12-27 15:52:47,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-27 15:52:47,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37942 states. [2019-12-27 15:52:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37942 to 26702. [2019-12-27 15:52:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26702 states. [2019-12-27 15:52:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26702 states to 26702 states and 83139 transitions. [2019-12-27 15:52:48,299 INFO L78 Accepts]: Start accepts. Automaton has 26702 states and 83139 transitions. Word has length 66 [2019-12-27 15:52:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:48,299 INFO L462 AbstractCegarLoop]: Abstraction has 26702 states and 83139 transitions. [2019-12-27 15:52:48,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:52:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 26702 states and 83139 transitions. [2019-12-27 15:52:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:52:48,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:48,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:48,327 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:48,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:48,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1912825147, now seen corresponding path program 1 times [2019-12-27 15:52:48,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:48,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25513530] [2019-12-27 15:52:48,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:48,427 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-27 15:52:48,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25513530] [2019-12-27 15:52:48,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:48,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:52:48,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [648347922] [2019-12-27 15:52:48,429 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:48,450 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:48,732 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 397 transitions. [2019-12-27 15:52:48,733 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:48,956 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 15:52:48,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:52:48,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:48,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:52:48,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:52:48,957 INFO L87 Difference]: Start difference. First operand 26702 states and 83139 transitions. Second operand 11 states. [2019-12-27 15:52:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:50,766 INFO L93 Difference]: Finished difference Result 51907 states and 160357 transitions. [2019-12-27 15:52:50,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:52:50,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 15:52:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:50,831 INFO L225 Difference]: With dead ends: 51907 [2019-12-27 15:52:50,831 INFO L226 Difference]: Without dead ends: 42308 [2019-12-27 15:52:50,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:52:50,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42308 states. [2019-12-27 15:52:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42308 to 27529. [2019-12-27 15:52:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27529 states. [2019-12-27 15:52:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27529 states to 27529 states and 85206 transitions. [2019-12-27 15:52:51,397 INFO L78 Accepts]: Start accepts. Automaton has 27529 states and 85206 transitions. Word has length 67 [2019-12-27 15:52:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:51,397 INFO L462 AbstractCegarLoop]: Abstraction has 27529 states and 85206 transitions. [2019-12-27 15:52:51,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:52:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 27529 states and 85206 transitions. [2019-12-27 15:52:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:52:51,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:51,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:51,429 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash 815980505, now seen corresponding path program 2 times [2019-12-27 15:52:51,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:51,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107044398] [2019-12-27 15:52:51,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:51,498 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-27 15:52:51,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107044398] [2019-12-27 15:52:51,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:51,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:52:51,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1984498255] [2019-12-27 15:52:51,500 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:51,515 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:51,979 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 492 transitions. [2019-12-27 15:52:51,979 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:51,981 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:52:51,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:52:51,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:51,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:52:51,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:52:51,982 INFO L87 Difference]: Start difference. First operand 27529 states and 85206 transitions. Second operand 4 states. [2019-12-27 15:52:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:52,127 INFO L93 Difference]: Finished difference Result 27529 states and 84982 transitions. [2019-12-27 15:52:52,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:52:52,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 15:52:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:52,167 INFO L225 Difference]: With dead ends: 27529 [2019-12-27 15:52:52,167 INFO L226 Difference]: Without dead ends: 27529 [2019-12-27 15:52:52,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:52:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27529 states. [2019-12-27 15:52:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27529 to 24273. [2019-12-27 15:52:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24273 states. [2019-12-27 15:52:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24273 states to 24273 states and 75622 transitions. [2019-12-27 15:52:52,590 INFO L78 Accepts]: Start accepts. Automaton has 24273 states and 75622 transitions. Word has length 67 [2019-12-27 15:52:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:52,590 INFO L462 AbstractCegarLoop]: Abstraction has 24273 states and 75622 transitions. [2019-12-27 15:52:52,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:52:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 24273 states and 75622 transitions. [2019-12-27 15:52:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:52:52,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:52,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:52,618 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:52,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1535531457, now seen corresponding path program 1 times [2019-12-27 15:52:52,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:52,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73217141] [2019-12-27 15:52:52,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:52,755 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-27 15:52:52,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73217141] [2019-12-27 15:52:52,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:52,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:52:52,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1674320688] [2019-12-27 15:52:52,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:52,770 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:53,034 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 490 transitions. [2019-12-27 15:52:53,034 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:53,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:52:53,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:52:53,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:53,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:52:53,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:52:53,148 INFO L87 Difference]: Start difference. First operand 24273 states and 75622 transitions. Second operand 11 states. [2019-12-27 15:52:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:56,503 INFO L93 Difference]: Finished difference Result 57054 states and 175572 transitions. [2019-12-27 15:52:56,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 15:52:56,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 15:52:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:56,582 INFO L225 Difference]: With dead ends: 57054 [2019-12-27 15:52:56,582 INFO L226 Difference]: Without dead ends: 51709 [2019-12-27 15:52:56,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=513, Invalid=2243, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 15:52:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51709 states. [2019-12-27 15:52:57,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51709 to 29530. [2019-12-27 15:52:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29530 states. [2019-12-27 15:52:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29530 states to 29530 states and 91945 transitions. [2019-12-27 15:52:57,407 INFO L78 Accepts]: Start accepts. Automaton has 29530 states and 91945 transitions. Word has length 67 [2019-12-27 15:52:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:57,407 INFO L462 AbstractCegarLoop]: Abstraction has 29530 states and 91945 transitions. [2019-12-27 15:52:57,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:52:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 29530 states and 91945 transitions. [2019-12-27 15:52:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:52:57,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:57,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:57,440 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:57,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:57,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1442171729, now seen corresponding path program 2 times [2019-12-27 15:52:57,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:57,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733858432] [2019-12-27 15:52:57,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:57,564 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-27 15:52:57,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733858432] [2019-12-27 15:52:57,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:57,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:52:57,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1810406601] [2019-12-27 15:52:57,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:57,582 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:57,971 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 314 states and 639 transitions. [2019-12-27 15:52:57,971 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:58,250 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 15:52:58,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:52:58,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:58,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:52:58,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:52:58,252 INFO L87 Difference]: Start difference. First operand 29530 states and 91945 transitions. Second operand 12 states. [2019-12-27 15:53:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:02,126 INFO L93 Difference]: Finished difference Result 61745 states and 189384 transitions. [2019-12-27 15:53:02,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 15:53:02,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 15:53:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:02,205 INFO L225 Difference]: With dead ends: 61745 [2019-12-27 15:53:02,205 INFO L226 Difference]: Without dead ends: 53354 [2019-12-27 15:53:02,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=522, Invalid=2028, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 15:53:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53354 states. [2019-12-27 15:53:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53354 to 24152. [2019-12-27 15:53:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24152 states. [2019-12-27 15:53:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24152 states to 24152 states and 74934 transitions. [2019-12-27 15:53:03,016 INFO L78 Accepts]: Start accepts. Automaton has 24152 states and 74934 transitions. Word has length 67 [2019-12-27 15:53:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:03,016 INFO L462 AbstractCegarLoop]: Abstraction has 24152 states and 74934 transitions. [2019-12-27 15:53:03,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:53:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 24152 states and 74934 transitions. [2019-12-27 15:53:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:53:03,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:03,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:03,040 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:03,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:03,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2065446981, now seen corresponding path program 3 times [2019-12-27 15:53:03,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:03,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878819112] [2019-12-27 15:53:03,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:03,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878819112] [2019-12-27 15:53:03,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:03,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:53:03,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2061537127] [2019-12-27 15:53:03,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:03,227 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:03,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 513 transitions. [2019-12-27 15:53:03,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:03,827 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 15:53:03,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:53:03,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:03,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:53:03,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:53:03,829 INFO L87 Difference]: Start difference. First operand 24152 states and 74934 transitions. Second operand 12 states. [2019-12-27 15:53:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:08,818 INFO L93 Difference]: Finished difference Result 63932 states and 195111 transitions. [2019-12-27 15:53:08,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 15:53:08,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 15:53:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:08,911 INFO L225 Difference]: With dead ends: 63932 [2019-12-27 15:53:08,911 INFO L226 Difference]: Without dead ends: 58587 [2019-12-27 15:53:08,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=575, Invalid=3457, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 15:53:09,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58587 states. [2019-12-27 15:53:09,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58587 to 29366. [2019-12-27 15:53:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29366 states. [2019-12-27 15:53:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29366 states to 29366 states and 91203 transitions. [2019-12-27 15:53:09,905 INFO L78 Accepts]: Start accepts. Automaton has 29366 states and 91203 transitions. Word has length 67 [2019-12-27 15:53:09,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:09,906 INFO L462 AbstractCegarLoop]: Abstraction has 29366 states and 91203 transitions. [2019-12-27 15:53:09,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:53:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 29366 states and 91203 transitions. [2019-12-27 15:53:09,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:53:09,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:09,938 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:09,939 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2136160587, now seen corresponding path program 4 times [2019-12-27 15:53:09,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:09,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915724501] [2019-12-27 15:53:09,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:10,089 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-27 15:53:10,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915724501] [2019-12-27 15:53:10,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:10,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:53:10,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1572353726] [2019-12-27 15:53:10,091 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:10,107 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:10,477 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 320 states and 662 transitions. [2019-12-27 15:53:10,478 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:10,710 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 15:53:10,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:53:10,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:10,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:53:10,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:53:10,712 INFO L87 Difference]: Start difference. First operand 29366 states and 91203 transitions. Second operand 13 states. [2019-12-27 15:53:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:16,321 INFO L93 Difference]: Finished difference Result 73505 states and 223520 transitions. [2019-12-27 15:53:16,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-12-27 15:53:16,321 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 15:53:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:16,421 INFO L225 Difference]: With dead ends: 73505 [2019-12-27 15:53:16,422 INFO L226 Difference]: Without dead ends: 65615 [2019-12-27 15:53:16,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 18 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=760, Invalid=3796, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 15:53:16,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65615 states. [2019-12-27 15:53:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65615 to 24115. [2019-12-27 15:53:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24115 states. [2019-12-27 15:53:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24115 states to 24115 states and 74654 transitions. [2019-12-27 15:53:17,345 INFO L78 Accepts]: Start accepts. Automaton has 24115 states and 74654 transitions. Word has length 67 [2019-12-27 15:53:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:17,345 INFO L462 AbstractCegarLoop]: Abstraction has 24115 states and 74654 transitions. [2019-12-27 15:53:17,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:53:17,346 INFO L276 IsEmpty]: Start isEmpty. Operand 24115 states and 74654 transitions. [2019-12-27 15:53:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:53:17,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:17,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:17,372 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:17,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:17,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1853423759, now seen corresponding path program 5 times [2019-12-27 15:53:17,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:17,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539585606] [2019-12-27 15:53:17,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:17,565 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-27 15:53:17,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539585606] [2019-12-27 15:53:17,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:17,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:53:17,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [291732511] [2019-12-27 15:53:17,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:17,588 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:17,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 498 transitions. [2019-12-27 15:53:17,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:18,046 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 15:53:18,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:53:18,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:18,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:53:18,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:53:18,047 INFO L87 Difference]: Start difference. First operand 24115 states and 74654 transitions. Second operand 13 states. [2019-12-27 15:53:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:19,080 INFO L93 Difference]: Finished difference Result 39258 states and 120162 transitions. [2019-12-27 15:53:19,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:53:19,080 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 15:53:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:19,140 INFO L225 Difference]: With dead ends: 39258 [2019-12-27 15:53:19,140 INFO L226 Difference]: Without dead ends: 39039 [2019-12-27 15:53:19,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-12-27 15:53:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39039 states. [2019-12-27 15:53:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39039 to 23939. [2019-12-27 15:53:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23939 states. [2019-12-27 15:53:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23939 states to 23939 states and 74182 transitions. [2019-12-27 15:53:19,619 INFO L78 Accepts]: Start accepts. Automaton has 23939 states and 74182 transitions. Word has length 67 [2019-12-27 15:53:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:19,619 INFO L462 AbstractCegarLoop]: Abstraction has 23939 states and 74182 transitions. [2019-12-27 15:53:19,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:53:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 23939 states and 74182 transitions. [2019-12-27 15:53:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:53:19,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:19,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:19,643 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:19,644 INFO L82 PathProgramCache]: Analyzing trace with hash 594227727, now seen corresponding path program 6 times [2019-12-27 15:53:19,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:19,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630304175] [2019-12-27 15:53:19,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:53:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:53:19,745 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:53:19,746 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:53:19,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~x~0_45 0) (= 0 v_~a$w_buff0_used~0_768) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t269~0.base_33|) (= v_~y~0_18 0) (= |v_ULTIMATE.start_main_~#t269~0.offset_23| 0) (= 0 v_~a$r_buff1_thd1~0_150) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$w_buff1_used~0_426) (= v_~main$tmp_guard0~0_29 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff1~0_200) (= v_~a$r_buff1_thd3~0_269 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_111) (= v_~a$r_buff0_thd3~0_320 0) (= v_~a~0_184 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~__unbuffered_cnt~0_102 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t269~0.base_33| 4) |v_#length_21|) (= 0 |v_#NULL.base_4|) (= v_~a$flush_delayed~0_25 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$r_buff0_thd0~0_107 0) (= v_~main$tmp_guard1~0_32 0) (= v_~a$r_buff1_thd0~0_160 0) (= v_~a$w_buff0~0_274 0) (= v_~z~0_21 0) (= |v_#NULL.offset_4| 0) (= v_~a$mem_tmp~0_14 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t269~0.base_33|) 0) (= 0 v_~a$r_buff0_thd1~0_184) (= 0 v_~a$r_buff1_thd2~0_145) (= v_~a$r_buff0_thd2~0_95 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t269~0.base_33| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t269~0.base_33|) |v_ULTIMATE.start_main_~#t269~0.offset_23| 0)) |v_#memory_int_19|) (= v_~weak$$choice2~0_110 0) (= v_~__unbuffered_p2_EBX~0_40 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t269~0.base_33| 1) |v_#valid_63|) (= 0 v_~a$read_delayed~0_8) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_145, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_67|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_471|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ~a~0=v_~a~0_184, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ULTIMATE.start_main_~#t270~0.offset=|v_ULTIMATE.start_main_~#t270~0.offset_19|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_768, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_184, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_274, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_45, ULTIMATE.start_main_~#t271~0.offset=|v_ULTIMATE.start_main_~#t271~0.offset_19|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_95, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_~#t271~0.base=|v_ULTIMATE.start_main_~#t271~0.base_25|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_29|, ~a$w_buff1~0=v_~a$w_buff1~0_200, ~y~0=v_~y~0_18, ULTIMATE.start_main_~#t269~0.base=|v_ULTIMATE.start_main_~#t269~0.base_33|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t269~0.offset=|v_ULTIMATE.start_main_~#t269~0.offset_23|, ULTIMATE.start_main_~#t270~0.base=|v_ULTIMATE.start_main_~#t270~0.base_25|, ~z~0=v_~z~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t270~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t271~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t271~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t269~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t269~0.offset, ULTIMATE.start_main_~#t270~0.base, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 15:53:19,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_20 |v_P0Thread1of1ForFork1_#in~arg.offset_20|) (= 1 v_~a$w_buff0_used~0_240) (= (mod v_~a$w_buff1_used~0_130 256) 0) (= v_~a$w_buff0_used~0_241 v_~a$w_buff1_used~0_130) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|) (= |v_P0Thread1of1ForFork1_#in~arg.base_20| v_P0Thread1of1ForFork1_~arg.base_20) (= 1 v_~a$w_buff0~0_55) (= v_~a$w_buff0~0_56 v_~a$w_buff1~0_50) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_241, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_55, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_240, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_20} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 15:53:19,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L837-1-->L839: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t270~0.base_12| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t270~0.base_12| 0)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t270~0.base_12|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t270~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t270~0.offset_10|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t270~0.base_12| 1) |v_#valid_34|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t270~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t270~0.base_12|) |v_ULTIMATE.start_main_~#t270~0.offset_10| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t270~0.offset=|v_ULTIMATE.start_main_~#t270~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t270~0.base=|v_ULTIMATE.start_main_~#t270~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t270~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t270~0.base, #length] because there is no mapped edge [2019-12-27 15:53:19,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L839-1-->L841: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t271~0.base_12| 4)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t271~0.base_12| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t271~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t271~0.base_12|) |v_ULTIMATE.start_main_~#t271~0.offset_10| 2)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t271~0.offset_10|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t271~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t271~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t271~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t271~0.base=|v_ULTIMATE.start_main_~#t271~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t271~0.offset=|v_ULTIMATE.start_main_~#t271~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t271~0.base, ULTIMATE.start_main_~#t271~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 15:53:19,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In-582581710 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-582581710 256) 0))) (or (and (not .cse0) (= ~a$w_buff1~0_In-582581710 |P1Thread1of1ForFork2_#t~ite9_Out-582581710|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-582581710| ~a~0_In-582581710)))) InVars {~a~0=~a~0_In-582581710, ~a$w_buff1~0=~a$w_buff1~0_In-582581710, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-582581710, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-582581710} OutVars{~a~0=~a~0_In-582581710, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-582581710|, ~a$w_buff1~0=~a$w_buff1~0_In-582581710, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-582581710, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-582581710} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 15:53:19,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_33) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_33, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_23|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 15:53:19,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-381995153 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-381995153 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-381995153| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-381995153| ~a$w_buff0_used~0_In-381995153)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-381995153, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-381995153} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-381995153, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-381995153, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-381995153|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 15:53:19,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-116150127 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-116150127 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-116150127 |P0Thread1of1ForFork1_#t~ite5_Out-116150127|)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-116150127| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-116150127, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-116150127} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-116150127|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-116150127, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-116150127} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 15:53:19,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-1031841554 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1031841554 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-1031841554 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1031841554 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1031841554|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-1031841554| ~a$w_buff1_used~0_In-1031841554)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1031841554, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1031841554, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1031841554, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1031841554} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1031841554|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1031841554, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1031841554, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1031841554, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1031841554} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 15:53:19,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1273766265 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1273766265 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out1273766265 ~a$r_buff0_thd1~0_In1273766265)) (and (not .cse1) (= ~a$r_buff0_thd1~0_Out1273766265 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1273766265, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1273766265} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1273766265|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1273766265, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1273766265} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:53:19,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1396420624 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1396420624 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1396420624 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-1396420624 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1396420624|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out-1396420624| ~a$r_buff1_thd1~0_In-1396420624) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1396420624, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1396420624, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1396420624, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1396420624} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1396420624|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1396420624, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1396420624, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1396420624, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1396420624} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 15:53:19,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_50|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_49|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 15:53:19,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-652492065 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-652492065| |P2Thread1of1ForFork0_#t~ite20_Out-652492065|) (= |P2Thread1of1ForFork0_#t~ite21_Out-652492065| ~a$w_buff0~0_In-652492065)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out-652492065| ~a$w_buff0~0_In-652492065) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-652492065 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-652492065 256) 0)) (and .cse1 (= (mod ~a$w_buff1_used~0_In-652492065 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-652492065 256)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-652492065| |P2Thread1of1ForFork0_#t~ite21_Out-652492065|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-652492065, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-652492065, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-652492065, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-652492065, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-652492065, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-652492065|, ~weak$$choice2~0=~weak$$choice2~0_In-652492065} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-652492065|, ~a$w_buff0~0=~a$w_buff0~0_In-652492065, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-652492065, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-652492065, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-652492065, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-652492065|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-652492065, ~weak$$choice2~0=~weak$$choice2~0_In-652492065} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 15:53:19,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L805-->L805-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-901839272 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In-901839272| |P2Thread1of1ForFork0_#t~ite26_Out-901839272|) (= |P2Thread1of1ForFork0_#t~ite27_Out-901839272| ~a$w_buff0_used~0_In-901839272) (not .cse0)) (and (= ~a$w_buff0_used~0_In-901839272 |P2Thread1of1ForFork0_#t~ite26_Out-901839272|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-901839272 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-901839272 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-901839272 256))) (and (= 0 (mod ~a$w_buff1_used~0_In-901839272 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite27_Out-901839272| |P2Thread1of1ForFork0_#t~ite26_Out-901839272|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-901839272|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-901839272, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-901839272, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-901839272, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-901839272, ~weak$$choice2~0=~weak$$choice2~0_In-901839272} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-901839272|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-901839272|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-901839272, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-901839272, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-901839272, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-901839272, ~weak$$choice2~0=~weak$$choice2~0_In-901839272} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 15:53:19,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 15:53:19,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_20 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 15:53:19,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In175253919 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In175253919 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out175253919| |P2Thread1of1ForFork0_#t~ite38_Out175253919|))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out175253919| ~a$w_buff1~0_In175253919) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out175253919| ~a~0_In175253919) .cse2))) InVars {~a~0=~a~0_In175253919, ~a$w_buff1~0=~a$w_buff1~0_In175253919, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In175253919, ~a$w_buff1_used~0=~a$w_buff1_used~0_In175253919} OutVars{~a~0=~a~0_In175253919, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out175253919|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out175253919|, ~a$w_buff1~0=~a$w_buff1~0_In175253919, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In175253919, ~a$w_buff1_used~0=~a$w_buff1_used~0_In175253919} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 15:53:19,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In443866949 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In443866949 256)))) (or (and (= ~a$w_buff0_used~0_In443866949 |P2Thread1of1ForFork0_#t~ite40_Out443866949|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out443866949|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In443866949, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In443866949} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out443866949|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In443866949, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In443866949} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 15:53:19,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In851747003 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In851747003 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In851747003 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In851747003 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In851747003 |P2Thread1of1ForFork0_#t~ite41_Out851747003|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out851747003|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In851747003, ~a$w_buff0_used~0=~a$w_buff0_used~0_In851747003, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In851747003, ~a$w_buff1_used~0=~a$w_buff1_used~0_In851747003} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In851747003, ~a$w_buff0_used~0=~a$w_buff0_used~0_In851747003, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In851747003, ~a$w_buff1_used~0=~a$w_buff1_used~0_In851747003, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out851747003|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 15:53:19,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd2~0_In1902864210 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In1902864210 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In1902864210 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1902864210 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1902864210|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1902864210 |P1Thread1of1ForFork2_#t~ite12_Out1902864210|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1902864210, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1902864210, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1902864210, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1902864210} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1902864210, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1902864210, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1902864210, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1902864210|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1902864210} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 15:53:19,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In670471031 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In670471031 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out670471031| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out670471031| ~a$r_buff0_thd2~0_In670471031) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In670471031, ~a$w_buff0_used~0=~a$w_buff0_used~0_In670471031} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In670471031, ~a$w_buff0_used~0=~a$w_buff0_used~0_In670471031, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out670471031|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 15:53:19,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1920052973 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1920052973 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1920052973 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1920052973 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-1920052973| ~a$r_buff1_thd2~0_In-1920052973)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1920052973| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1920052973, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1920052973, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1920052973, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1920052973} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1920052973, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1920052973, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1920052973, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1920052973, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1920052973|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 15:53:19,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_36| v_~a$r_buff1_thd2~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 15:53:19,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1575953360 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1575953360 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1575953360|) (not .cse1)) (and (= ~a$r_buff0_thd3~0_In-1575953360 |P2Thread1of1ForFork0_#t~ite42_Out-1575953360|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1575953360, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1575953360} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1575953360, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1575953360, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1575953360|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 15:53:19,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-10990048 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-10990048 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-10990048 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-10990048 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-10990048| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out-10990048| ~a$r_buff1_thd3~0_In-10990048) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-10990048, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-10990048, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-10990048, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-10990048} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-10990048|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-10990048, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-10990048, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-10990048, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-10990048} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 15:53:19,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_149 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_149, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 15:53:19,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_40) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 15:53:19,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-451438267 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-451438267 256)))) (or (and (= ~a$w_buff1~0_In-451438267 |ULTIMATE.start_main_#t~ite47_Out-451438267|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out-451438267| ~a~0_In-451438267) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-451438267, ~a$w_buff1~0=~a$w_buff1~0_In-451438267, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-451438267, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-451438267} OutVars{~a~0=~a~0_In-451438267, ~a$w_buff1~0=~a$w_buff1~0_In-451438267, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-451438267|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-451438267, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-451438267} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 15:53:19,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_39 |v_ULTIMATE.start_main_#t~ite47_15|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|} OutVars{~a~0=v_~a~0_39, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 15:53:19,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1656254157 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1656254157 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1656254157| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1656254157| ~a$w_buff0_used~0_In-1656254157) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1656254157, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1656254157} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1656254157, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1656254157|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1656254157} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 15:53:19,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In-71206816 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-71206816 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-71206816 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-71206816 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-71206816| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite50_Out-71206816| ~a$w_buff1_used~0_In-71206816)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-71206816, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-71206816, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-71206816, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-71206816} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-71206816|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-71206816, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-71206816, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-71206816, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-71206816} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 15:53:19,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1747459633 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1747459633 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1747459633|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In1747459633 |ULTIMATE.start_main_#t~ite51_Out1747459633|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1747459633, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1747459633} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1747459633|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1747459633, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1747459633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 15:53:19,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In2026030119 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In2026030119 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In2026030119 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In2026030119 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In2026030119 |ULTIMATE.start_main_#t~ite52_Out2026030119|)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out2026030119|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2026030119, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2026030119, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2026030119, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2026030119} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2026030119|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2026030119, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2026030119, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2026030119, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2026030119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 15:53:19,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p0_EAX~0_39) (= v_~main$tmp_guard1~0_12 0) (= 1 v_~__unbuffered_p1_EAX~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~ite52_30| v_~a$r_buff1_thd0~0_75) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_12 256)) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_29|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:53:19,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:53:19 BasicIcfg [2019-12-27 15:53:19,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:53:19,857 INFO L168 Benchmark]: Toolchain (without parser) took 169109.36 ms. Allocated memory was 137.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 101.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 15:53:19,858 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 15:53:19,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.40 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 153.3 MB in the end (delta: -52.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:19,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.69 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 150.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:19,859 INFO L168 Benchmark]: Boogie Preprocessor took 46.50 ms. Allocated memory is still 201.9 MB. Free memory was 150.5 MB in the beginning and 147.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:19,860 INFO L168 Benchmark]: RCFGBuilder took 942.93 ms. Allocated memory is still 201.9 MB. Free memory was 147.8 MB in the beginning and 97.4 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:19,860 INFO L168 Benchmark]: TraceAbstraction took 167277.32 ms. Allocated memory was 201.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 96.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-27 15:53:19,862 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.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.40 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 153.3 MB in the end (delta: -52.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.69 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 150.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.50 ms. Allocated memory is still 201.9 MB. Free memory was 150.5 MB in the beginning and 147.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 942.93 ms. Allocated memory is still 201.9 MB. Free memory was 147.8 MB in the beginning and 97.4 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 167277.32 ms. Allocated memory was 201.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 96.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6646 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 59 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 91218 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L841] FCALL, FORK 0 pthread_create(&t271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 166.9s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 67.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10791 SDtfs, 19408 SDslu, 43751 SDs, 0 SdLazy, 28429 SolverSat, 1151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1026 GetRequests, 246 SyntacticMatches, 118 SemanticMatches, 662 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8413 ImplicationChecksByTransitivity, 15.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168271occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 56.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 880969 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1718 NumberOfCodeBlocks, 1718 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 339448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...