/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:08:51,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:08:51,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:08:51,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:08:51,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:08:51,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:08:51,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:08:51,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:08:51,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:08:51,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:08:51,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:08:51,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:08:51,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:08:51,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:08:51,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:08:51,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:08:51,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:08:51,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:08:51,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:08:51,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:08:51,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:08:51,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:08:51,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:08:51,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:08:51,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:08:51,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:08:51,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:08:51,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:08:51,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:08:51,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:08:51,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:08:51,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:08:51,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:08:51,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:08:51,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:08:51,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:08:51,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:08:51,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:08:51,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:08:51,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:08:51,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:08:51,684 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-VariableLbe-MCR.epf [2019-12-27 21:08:51,719 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:08:51,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:08:51,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:08:51,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:08:51,727 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:08:51,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:08:51,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:08:51,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:08:51,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:08:51,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:08:51,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:08:51,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:08:51,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:08:51,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:08:51,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:08:51,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:08:51,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:08:51,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:08:51,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:08:51,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:08:51,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:08:51,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:08:51,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:08:51,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:08:51,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:08:51,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:08:51,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:08:51,732 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:08:51,732 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:08:51,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:08:51,732 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:08:51,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:08:52,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:08:52,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:08:52,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:08:52,033 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:08:52,034 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:08:52,034 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i [2019-12-27 21:08:52,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb89e1c59/95146ee30d004338bf9e0528d8146bee/FLAGea62dd5e3 [2019-12-27 21:08:52,667 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:08:52,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i [2019-12-27 21:08:52,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb89e1c59/95146ee30d004338bf9e0528d8146bee/FLAGea62dd5e3 [2019-12-27 21:08:52,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb89e1c59/95146ee30d004338bf9e0528d8146bee [2019-12-27 21:08:52,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:08:52,944 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:08:52,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:08:52,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:08:52,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:08:52,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:08:52" (1/1) ... [2019-12-27 21:08:52,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a48cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:52, skipping insertion in model container [2019-12-27 21:08:52,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:08:52" (1/1) ... [2019-12-27 21:08:52,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:08:53,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:08:53,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:08:53,576 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:08:53,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:08:53,717 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:08:53,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:53 WrapperNode [2019-12-27 21:08:53,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:08:53,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:08:53,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:08:53,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:08:53,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:53" (1/1) ... [2019-12-27 21:08:53,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:53" (1/1) ... [2019-12-27 21:08:53,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:08:53,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:08:53,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:08:53,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:08:53,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:53" (1/1) ... [2019-12-27 21:08:53,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:53" (1/1) ... [2019-12-27 21:08:53,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:53" (1/1) ... [2019-12-27 21:08:53,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:53" (1/1) ... [2019-12-27 21:08:53,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:53" (1/1) ... [2019-12-27 21:08:53,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:53" (1/1) ... [2019-12-27 21:08:53,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:53" (1/1) ... [2019-12-27 21:08:53,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:08:53,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:08:53,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:08:53,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:08:53,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:53" (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 21:08:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:08:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:08:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:08:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:08:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:08:53,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:08:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:08:53,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:08:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:08:53,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:08:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:08:53,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:08:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:08:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:08:53,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:08:53,873 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 21:08:54,634 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:08:54,634 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:08:54,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:08:54 BoogieIcfgContainer [2019-12-27 21:08:54,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:08:54,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:08:54,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:08:54,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:08:54,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:08:52" (1/3) ... [2019-12-27 21:08:54,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191564af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:08:54, skipping insertion in model container [2019-12-27 21:08:54,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:53" (2/3) ... [2019-12-27 21:08:54,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191564af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:08:54, skipping insertion in model container [2019-12-27 21:08:54,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:08:54" (3/3) ... [2019-12-27 21:08:54,645 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_power.opt.i [2019-12-27 21:08:54,656 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:08:54,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:08:54,667 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:08:54,668 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:08:54,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,710 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,710 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,713 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,713 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,767 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,767 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,767 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,768 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,783 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,784 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,793 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,794 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,794 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,795 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,795 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,797 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,798 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,800 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,801 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:54,816 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:08:54,838 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:08:54,838 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:08:54,838 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:08:54,839 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:08:54,839 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:08:54,839 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:08:54,839 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:08:54,839 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:08:54,862 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-12-27 21:08:54,864 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-27 21:08:54,956 INFO L132 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-27 21:08:54,956 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:08:54,970 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:08:54,991 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-27 21:08:55,065 INFO L132 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-27 21:08:55,065 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:08:55,074 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:08:55,094 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 21:08:55,095 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:08:58,141 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-12-27 21:08:58,692 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:08:58,833 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:08:59,125 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 21:08:59,262 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 21:08:59,280 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50510 [2019-12-27 21:08:59,281 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 21:08:59,284 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 88 transitions [2019-12-27 21:09:01,285 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 30990 states. [2019-12-27 21:09:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 30990 states. [2019-12-27 21:09:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:09:01,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:01,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:01,295 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:01,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:01,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1670049475, now seen corresponding path program 1 times [2019-12-27 21:09:01,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:01,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752437280] [2019-12-27 21:09:01,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:01,641 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 21:09:01,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752437280] [2019-12-27 21:09:01,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:01,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:09:01,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [73797259] [2019-12-27 21:09:01,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:01,653 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:01,668 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:09:01,669 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:01,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:09:01,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:09:01,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:01,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:09:01,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:09:01,689 INFO L87 Difference]: Start difference. First operand 30990 states. Second operand 3 states. [2019-12-27 21:09:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:03,019 INFO L93 Difference]: Finished difference Result 29806 states and 128112 transitions. [2019-12-27 21:09:03,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:09:03,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:09:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:03,286 INFO L225 Difference]: With dead ends: 29806 [2019-12-27 21:09:03,286 INFO L226 Difference]: Without dead ends: 28014 [2019-12-27 21:09:03,297 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 21:09:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28014 states. [2019-12-27 21:09:04,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28014 to 28014. [2019-12-27 21:09:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28014 states. [2019-12-27 21:09:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28014 states to 28014 states and 120256 transitions. [2019-12-27 21:09:04,834 INFO L78 Accepts]: Start accepts. Automaton has 28014 states and 120256 transitions. Word has length 9 [2019-12-27 21:09:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:04,836 INFO L462 AbstractCegarLoop]: Abstraction has 28014 states and 120256 transitions. [2019-12-27 21:09:04,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:09:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 28014 states and 120256 transitions. [2019-12-27 21:09:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:09:04,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:04,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:04,845 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:04,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:04,846 INFO L82 PathProgramCache]: Analyzing trace with hash 165441832, now seen corresponding path program 1 times [2019-12-27 21:09:04,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:04,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601541639] [2019-12-27 21:09:04,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:05,922 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 21:09:05,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601541639] [2019-12-27 21:09:05,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:05,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:09:05,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1679064271] [2019-12-27 21:09:05,923 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:05,925 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:05,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:09:05,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:05,929 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:09:05,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:09:05,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:05,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:09:05,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:09:05,932 INFO L87 Difference]: Start difference. First operand 28014 states and 120256 transitions. Second operand 3 states. [2019-12-27 21:09:06,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:06,164 INFO L93 Difference]: Finished difference Result 22347 states and 89103 transitions. [2019-12-27 21:09:06,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:09:06,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:09:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:06,255 INFO L225 Difference]: With dead ends: 22347 [2019-12-27 21:09:06,255 INFO L226 Difference]: Without dead ends: 22347 [2019-12-27 21:09:06,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:09:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22347 states. [2019-12-27 21:09:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22347 to 22347. [2019-12-27 21:09:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22347 states. [2019-12-27 21:09:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22347 states to 22347 states and 89103 transitions. [2019-12-27 21:09:07,274 INFO L78 Accepts]: Start accepts. Automaton has 22347 states and 89103 transitions. Word has length 15 [2019-12-27 21:09:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:07,274 INFO L462 AbstractCegarLoop]: Abstraction has 22347 states and 89103 transitions. [2019-12-27 21:09:07,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:09:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 22347 states and 89103 transitions. [2019-12-27 21:09:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:09:07,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:07,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:07,278 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:07,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1942943562, now seen corresponding path program 1 times [2019-12-27 21:09:07,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:07,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262974851] [2019-12-27 21:09:07,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:07,342 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 21:09:07,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262974851] [2019-12-27 21:09:07,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:07,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:09:07,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [433581666] [2019-12-27 21:09:07,343 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:07,345 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:07,348 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:09:07,348 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:07,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:09:07,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:09:07,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:07,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:09:07,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:09:07,420 INFO L87 Difference]: Start difference. First operand 22347 states and 89103 transitions. Second operand 6 states. [2019-12-27 21:09:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:07,540 INFO L93 Difference]: Finished difference Result 10229 states and 34571 transitions. [2019-12-27 21:09:07,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:09:07,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-27 21:09:07,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:07,565 INFO L225 Difference]: With dead ends: 10229 [2019-12-27 21:09:07,565 INFO L226 Difference]: Without dead ends: 10229 [2019-12-27 21:09:07,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:09:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10229 states. [2019-12-27 21:09:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10229 to 10229. [2019-12-27 21:09:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2019-12-27 21:09:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 34571 transitions. [2019-12-27 21:09:07,844 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 34571 transitions. Word has length 16 [2019-12-27 21:09:07,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:07,845 INFO L462 AbstractCegarLoop]: Abstraction has 10229 states and 34571 transitions. [2019-12-27 21:09:07,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:09:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 34571 transitions. [2019-12-27 21:09:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:09:07,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:07,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:07,848 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1127389089, now seen corresponding path program 1 times [2019-12-27 21:09:07,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:07,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722107387] [2019-12-27 21:09:07,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:07,944 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 21:09:07,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722107387] [2019-12-27 21:09:07,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:07,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:09:07,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [122121855] [2019-12-27 21:09:07,946 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:07,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:07,953 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:09:07,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:08,068 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:09:08,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:09:08,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:08,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:09:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:09:08,070 INFO L87 Difference]: Start difference. First operand 10229 states and 34571 transitions. Second operand 9 states. [2019-12-27 21:09:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:08,174 INFO L93 Difference]: Finished difference Result 2968 states and 9107 transitions. [2019-12-27 21:09:08,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:09:08,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-12-27 21:09:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:08,180 INFO L225 Difference]: With dead ends: 2968 [2019-12-27 21:09:08,180 INFO L226 Difference]: Without dead ends: 2968 [2019-12-27 21:09:08,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:09:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2019-12-27 21:09:08,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2968. [2019-12-27 21:09:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2019-12-27 21:09:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 9107 transitions. [2019-12-27 21:09:08,254 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 9107 transitions. Word has length 17 [2019-12-27 21:09:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:08,254 INFO L462 AbstractCegarLoop]: Abstraction has 2968 states and 9107 transitions. [2019-12-27 21:09:08,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:09:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 9107 transitions. [2019-12-27 21:09:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:09:08,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:08,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:08,257 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:08,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:08,257 INFO L82 PathProgramCache]: Analyzing trace with hash 506293938, now seen corresponding path program 1 times [2019-12-27 21:09:08,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:08,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51284625] [2019-12-27 21:09:08,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:08,464 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 21:09:08,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51284625] [2019-12-27 21:09:08,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:08,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:09:08,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379668710] [2019-12-27 21:09:08,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:08,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:08,477 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 21:09:08,477 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:08,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:09:08,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:09:08,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:08,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:09:08,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:09:08,509 INFO L87 Difference]: Start difference. First operand 2968 states and 9107 transitions. Second operand 5 states. [2019-12-27 21:09:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:08,731 INFO L93 Difference]: Finished difference Result 3751 states and 11312 transitions. [2019-12-27 21:09:08,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:09:08,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 21:09:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:08,739 INFO L225 Difference]: With dead ends: 3751 [2019-12-27 21:09:08,739 INFO L226 Difference]: Without dead ends: 3751 [2019-12-27 21:09:08,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:09:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2019-12-27 21:09:08,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 3583. [2019-12-27 21:09:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3583 states. [2019-12-27 21:09:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 10934 transitions. [2019-12-27 21:09:08,838 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 10934 transitions. Word has length 18 [2019-12-27 21:09:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:08,839 INFO L462 AbstractCegarLoop]: Abstraction has 3583 states and 10934 transitions. [2019-12-27 21:09:08,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:09:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 10934 transitions. [2019-12-27 21:09:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:09:08,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:08,848 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] [2019-12-27 21:09:08,848 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:08,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1112111079, now seen corresponding path program 1 times [2019-12-27 21:09:08,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:08,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27419179] [2019-12-27 21:09:08,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:08,946 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 21:09:08,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27419179] [2019-12-27 21:09:08,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:08,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:09:08,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1521473068] [2019-12-27 21:09:08,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:08,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:08,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 46 transitions. [2019-12-27 21:09:08,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:09,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:09:09,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:09:09,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:09,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:09:09,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:09:09,005 INFO L87 Difference]: Start difference. First operand 3583 states and 10934 transitions. Second operand 6 states. [2019-12-27 21:09:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:09,051 INFO L93 Difference]: Finished difference Result 5481 states and 15973 transitions. [2019-12-27 21:09:09,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:09:09,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 21:09:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:09,058 INFO L225 Difference]: With dead ends: 5481 [2019-12-27 21:09:09,058 INFO L226 Difference]: Without dead ends: 3607 [2019-12-27 21:09:09,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:09:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-27 21:09:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3575. [2019-12-27 21:09:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3575 states. [2019-12-27 21:09:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3575 states to 3575 states and 10798 transitions. [2019-12-27 21:09:09,133 INFO L78 Accepts]: Start accepts. Automaton has 3575 states and 10798 transitions. Word has length 32 [2019-12-27 21:09:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:09,134 INFO L462 AbstractCegarLoop]: Abstraction has 3575 states and 10798 transitions. [2019-12-27 21:09:09,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:09:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3575 states and 10798 transitions. [2019-12-27 21:09:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:09:09,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:09,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:09,142 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1047758670, now seen corresponding path program 1 times [2019-12-27 21:09:09,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:09,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318855293] [2019-12-27 21:09:09,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:09,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318855293] [2019-12-27 21:09:09,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:09,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:09:09,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004946577] [2019-12-27 21:09:09,188 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:09,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:09,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 336 transitions. [2019-12-27 21:09:09,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:09,288 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:09:09,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:09:09,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:09,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:09:09,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:09:09,289 INFO L87 Difference]: Start difference. First operand 3575 states and 10798 transitions. Second operand 5 states. [2019-12-27 21:09:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:09,396 INFO L93 Difference]: Finished difference Result 5225 states and 15665 transitions. [2019-12-27 21:09:09,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:09:09,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 21:09:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:09,407 INFO L225 Difference]: With dead ends: 5225 [2019-12-27 21:09:09,407 INFO L226 Difference]: Without dead ends: 5225 [2019-12-27 21:09:09,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:09:09,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2019-12-27 21:09:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4249. [2019-12-27 21:09:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4249 states. [2019-12-27 21:09:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 12995 transitions. [2019-12-27 21:09:09,497 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 12995 transitions. Word has length 32 [2019-12-27 21:09:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:09,498 INFO L462 AbstractCegarLoop]: Abstraction has 4249 states and 12995 transitions. [2019-12-27 21:09:09,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:09:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 12995 transitions. [2019-12-27 21:09:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:09:09,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:09,508 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] [2019-12-27 21:09:09,508 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:09,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:09,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1443701580, now seen corresponding path program 1 times [2019-12-27 21:09:09,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:09,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676639234] [2019-12-27 21:09:09,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:09,568 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 21:09:09,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676639234] [2019-12-27 21:09:09,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:09,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:09:09,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1628305276] [2019-12-27 21:09:09,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:09,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:09,695 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 336 transitions. [2019-12-27 21:09:09,696 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:09,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:09:09,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:09:09,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:09,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:09:09,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:09:09,730 INFO L87 Difference]: Start difference. First operand 4249 states and 12995 transitions. Second operand 5 states. [2019-12-27 21:09:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:09,820 INFO L93 Difference]: Finished difference Result 5225 states and 15251 transitions. [2019-12-27 21:09:09,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:09:09,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 21:09:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:09,830 INFO L225 Difference]: With dead ends: 5225 [2019-12-27 21:09:09,831 INFO L226 Difference]: Without dead ends: 5225 [2019-12-27 21:09:09,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:09:09,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2019-12-27 21:09:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4213. [2019-12-27 21:09:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4213 states. [2019-12-27 21:09:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 4213 states and 12512 transitions. [2019-12-27 21:09:09,918 INFO L78 Accepts]: Start accepts. Automaton has 4213 states and 12512 transitions. Word has length 32 [2019-12-27 21:09:09,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:09,918 INFO L462 AbstractCegarLoop]: Abstraction has 4213 states and 12512 transitions. [2019-12-27 21:09:09,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:09:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4213 states and 12512 transitions. [2019-12-27 21:09:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:09:09,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:09,926 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] [2019-12-27 21:09:09,926 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:09,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:09,927 INFO L82 PathProgramCache]: Analyzing trace with hash 121864036, now seen corresponding path program 1 times [2019-12-27 21:09:09,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:09,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803649319] [2019-12-27 21:09:09,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:10,002 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 21:09:10,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803649319] [2019-12-27 21:09:10,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:10,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:09:10,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1664666524] [2019-12-27 21:09:10,003 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:10,011 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:10,063 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 336 transitions. [2019-12-27 21:09:10,063 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:10,188 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:09:10,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:09:10,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:09:10,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:09:10,189 INFO L87 Difference]: Start difference. First operand 4213 states and 12512 transitions. Second operand 11 states. [2019-12-27 21:09:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:10,308 INFO L93 Difference]: Finished difference Result 3178 states and 9948 transitions. [2019-12-27 21:09:10,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:09:10,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-12-27 21:09:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:10,314 INFO L225 Difference]: With dead ends: 3178 [2019-12-27 21:09:10,315 INFO L226 Difference]: Without dead ends: 2924 [2019-12-27 21:09:10,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:09:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2019-12-27 21:09:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2744. [2019-12-27 21:09:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2019-12-27 21:09:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 8606 transitions. [2019-12-27 21:09:10,367 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 8606 transitions. Word has length 32 [2019-12-27 21:09:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:10,368 INFO L462 AbstractCegarLoop]: Abstraction has 2744 states and 8606 transitions. [2019-12-27 21:09:10,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:09:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 8606 transitions. [2019-12-27 21:09:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:09:10,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:10,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:10,375 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:10,376 INFO L82 PathProgramCache]: Analyzing trace with hash 992352402, now seen corresponding path program 1 times [2019-12-27 21:09:10,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:10,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636106093] [2019-12-27 21:09:10,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:10,445 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 21:09:10,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636106093] [2019-12-27 21:09:10,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:10,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:09:10,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1390631726] [2019-12-27 21:09:10,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:10,466 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:10,575 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 246 transitions. [2019-12-27 21:09:10,575 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:10,576 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:09:10,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:09:10,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:10,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:09:10,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:09:10,578 INFO L87 Difference]: Start difference. First operand 2744 states and 8606 transitions. Second operand 3 states. [2019-12-27 21:09:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:10,602 INFO L93 Difference]: Finished difference Result 4096 states and 12179 transitions. [2019-12-27 21:09:10,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:09:10,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 21:09:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:10,605 INFO L225 Difference]: With dead ends: 4096 [2019-12-27 21:09:10,605 INFO L226 Difference]: Without dead ends: 1418 [2019-12-27 21:09:10,606 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 21:09:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2019-12-27 21:09:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1418. [2019-12-27 21:09:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-27 21:09:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 3722 transitions. [2019-12-27 21:09:10,630 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 3722 transitions. Word has length 47 [2019-12-27 21:09:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:10,630 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 3722 transitions. [2019-12-27 21:09:10,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:09:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 3722 transitions. [2019-12-27 21:09:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:09:10,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:10,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:10,634 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:10,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2081953324, now seen corresponding path program 2 times [2019-12-27 21:09:10,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:10,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598058338] [2019-12-27 21:09:10,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:10,724 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 21:09:10,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598058338] [2019-12-27 21:09:10,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:10,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:09:10,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1000574953] [2019-12-27 21:09:10,726 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:10,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:10,946 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 233 transitions. [2019-12-27 21:09:10,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:10,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:09:10,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:09:10,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:10,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:09:10,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:09:10,949 INFO L87 Difference]: Start difference. First operand 1418 states and 3722 transitions. Second operand 7 states. [2019-12-27 21:09:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:11,227 INFO L93 Difference]: Finished difference Result 3765 states and 9849 transitions. [2019-12-27 21:09:11,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:09:11,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 21:09:11,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:11,233 INFO L225 Difference]: With dead ends: 3765 [2019-12-27 21:09:11,233 INFO L226 Difference]: Without dead ends: 2471 [2019-12-27 21:09:11,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:09:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-12-27 21:09:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 1595. [2019-12-27 21:09:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-27 21:09:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 4164 transitions. [2019-12-27 21:09:11,268 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 4164 transitions. Word has length 47 [2019-12-27 21:09:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:11,268 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 4164 transitions. [2019-12-27 21:09:11,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:09:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 4164 transitions. [2019-12-27 21:09:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:09:11,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:11,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:11,273 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:11,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1032275112, now seen corresponding path program 3 times [2019-12-27 21:09:11,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:11,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820028524] [2019-12-27 21:09:11,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:11,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820028524] [2019-12-27 21:09:11,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:11,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:09:11,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1116689728] [2019-12-27 21:09:11,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:11,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:11,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 369 transitions. [2019-12-27 21:09:11,627 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:11,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:09:11,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:09:11,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:11,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:09:11,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:09:11,757 INFO L87 Difference]: Start difference. First operand 1595 states and 4164 transitions. Second operand 14 states. [2019-12-27 21:09:15,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:15,367 INFO L93 Difference]: Finished difference Result 3588 states and 8866 transitions. [2019-12-27 21:09:15,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 21:09:15,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-12-27 21:09:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:15,374 INFO L225 Difference]: With dead ends: 3588 [2019-12-27 21:09:15,375 INFO L226 Difference]: Without dead ends: 3552 [2019-12-27 21:09:15,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=480, Invalid=1590, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 21:09:15,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2019-12-27 21:09:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 1777. [2019-12-27 21:09:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1777 states. [2019-12-27 21:09:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 4504 transitions. [2019-12-27 21:09:15,418 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 4504 transitions. Word has length 47 [2019-12-27 21:09:15,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:15,418 INFO L462 AbstractCegarLoop]: Abstraction has 1777 states and 4504 transitions. [2019-12-27 21:09:15,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:09:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 4504 transitions. [2019-12-27 21:09:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:09:15,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:15,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:15,423 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:15,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:15,424 INFO L82 PathProgramCache]: Analyzing trace with hash 650117112, now seen corresponding path program 4 times [2019-12-27 21:09:15,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:15,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406489611] [2019-12-27 21:09:15,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:15,543 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 21:09:15,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406489611] [2019-12-27 21:09:15,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:15,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:09:15,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924464186] [2019-12-27 21:09:15,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:15,557 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:15,673 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 270 transitions. [2019-12-27 21:09:15,673 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:15,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:09:15,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:09:15,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:15,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:09:15,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:09:15,764 INFO L87 Difference]: Start difference. First operand 1777 states and 4504 transitions. Second operand 8 states. [2019-12-27 21:09:17,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:17,192 INFO L93 Difference]: Finished difference Result 3768 states and 9500 transitions. [2019-12-27 21:09:17,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:09:17,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-12-27 21:09:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:17,199 INFO L225 Difference]: With dead ends: 3768 [2019-12-27 21:09:17,199 INFO L226 Difference]: Without dead ends: 3768 [2019-12-27 21:09:17,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:09:17,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2019-12-27 21:09:17,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 1879. [2019-12-27 21:09:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2019-12-27 21:09:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4801 transitions. [2019-12-27 21:09:17,229 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4801 transitions. Word has length 47 [2019-12-27 21:09:17,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:17,229 INFO L462 AbstractCegarLoop]: Abstraction has 1879 states and 4801 transitions. [2019-12-27 21:09:17,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:09:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4801 transitions. [2019-12-27 21:09:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:09:17,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:17,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:17,233 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:17,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 88691356, now seen corresponding path program 5 times [2019-12-27 21:09:17,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:17,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971010394] [2019-12-27 21:09:17,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:17,310 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 21:09:17,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971010394] [2019-12-27 21:09:17,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:17,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:09:17,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [713186030] [2019-12-27 21:09:17,311 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:17,324 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:17,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 330 transitions. [2019-12-27 21:09:17,471 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:17,471 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:09:17,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:09:17,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:17,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:09:17,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:09:17,472 INFO L87 Difference]: Start difference. First operand 1879 states and 4801 transitions. Second operand 3 states. [2019-12-27 21:09:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:17,488 INFO L93 Difference]: Finished difference Result 1877 states and 4796 transitions. [2019-12-27 21:09:17,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:09:17,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 21:09:17,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:17,491 INFO L225 Difference]: With dead ends: 1877 [2019-12-27 21:09:17,492 INFO L226 Difference]: Without dead ends: 1877 [2019-12-27 21:09:17,492 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 21:09:17,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-12-27 21:09:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1511. [2019-12-27 21:09:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2019-12-27 21:09:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 3867 transitions. [2019-12-27 21:09:17,517 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 3867 transitions. Word has length 47 [2019-12-27 21:09:17,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:17,518 INFO L462 AbstractCegarLoop]: Abstraction has 1511 states and 3867 transitions. [2019-12-27 21:09:17,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:09:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 3867 transitions. [2019-12-27 21:09:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:09:17,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:17,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:17,521 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:17,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:17,521 INFO L82 PathProgramCache]: Analyzing trace with hash 378110637, now seen corresponding path program 1 times [2019-12-27 21:09:17,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:17,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329278351] [2019-12-27 21:09:17,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:09:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:09:17,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:09:17,638 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:09:17,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~__unbuffered_p3_EBX~0_16) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_28|)) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a~0_9) (= 0 v_~z$r_buff1_thd3~0_41) (= v_~y~0_18 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1061~0.base_28| 4)) (= 0 v_~z$r_buff1_thd1~0_10) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~weak$$choice0~0_9) (= v_~z$r_buff0_thd1~0_10 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd3~0_63 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_28| 1)) (= v_~z$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_21 0) (= v_~b~0_11 0) (= 0 v_~z$w_buff1~0_22) (= 0 v_~__unbuffered_p3_EAX~0_17) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t1061~0.base_28| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t1061~0.base_28|) |v_ULTIMATE.start_main_~#t1061~0.offset_22| 0)) |v_#memory_int_29|) (= v_~x~0_17 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd4~0_26 0) (= 0 v_~__unbuffered_p2_EAX~0_17) (= 0 v_~z$flush_delayed~0_14) (= 0 v_~z$r_buff1_thd2~0_10) (= v_~z~0_23 0) (= v_~z$w_buff0_used~0_91 0) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff1_thd0~0_22) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff1_thd4~0_17) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_4| 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~z$w_buff0~0_25) (= 0 |v_ULTIMATE.start_main_~#t1061~0.offset_22|) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1061~0.base_28|) (= 0 v_~z$w_buff1_used~0_57))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_21|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_17, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_27|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_27|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_17, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t1061~0.base=|v_ULTIMATE.start_main_~#t1061~0.base_28|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_20|, ~y~0=v_~y~0_18, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_25, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_~#t1061~0.offset=|v_ULTIMATE.start_main_~#t1061~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1063~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1062~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1064~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1061~0.base, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1064~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1062~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1061~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:09:17,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1062~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1062~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13|) |v_ULTIMATE.start_main_~#t1062~0.offset_11| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1062~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1062~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1062~0.offset] because there is no mapped edge [2019-12-27 21:09:17,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L843-1-->L845: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13|) |v_ULTIMATE.start_main_~#t1063~0.offset_11| 2)) |v_#memory_int_19|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1063~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1063~0.base_13| 4)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1063~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1063~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1063~0.offset] because there is no mapped edge [2019-12-27 21:09:17,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1064~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11|) |v_ULTIMATE.start_main_~#t1064~0.offset_10| 3)) |v_#memory_int_17|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1064~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1064~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1064~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1064~0.base, #length, ULTIMATE.start_main_~#t1064~0.offset] because there is no mapped edge [2019-12-27 21:09:17,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= (mod v_~z$w_buff1_used~0_38 256) 0) (= v_P3Thread1of1ForFork1_~arg.base_4 |v_P3Thread1of1ForFork1_#in~arg.base_4|) (= v_~z$w_buff0_used~0_61 v_~z$w_buff1_used~0_38) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6) (= v_~z$w_buff0_used~0_60 1) (= v_~z$w_buff0~0_14 v_~z$w_buff1~0_12) (= |v_P3Thread1of1ForFork1_#in~arg.offset_4| v_P3Thread1of1ForFork1_~arg.offset_4) (= 1 v_~z$w_buff0~0_13)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_61, ~z$w_buff0~0=v_~z$w_buff0~0_14, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_4|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_4|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_60, ~z$w_buff0~0=v_~z$w_buff0~0_13, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_4|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_38, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, ~z$w_buff1~0=v_~z$w_buff1~0_12, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_4, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_4|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 21:09:17,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~x~0_7) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= 1 v_~b~0_6)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~b~0=v_~b~0_6, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 21:09:17,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 2 v_~x~0_8) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= 1 v_~y~0_8) (= v_P1Thread1of1ForFork3_~arg.offset_4 |v_P1Thread1of1ForFork3_#in~arg.offset_4|) (= v_P1Thread1of1ForFork3_~arg.base_4 |v_P1Thread1of1ForFork3_#in~arg.base_4|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_4, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_4|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_4, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_4|, ~y~0=v_~y~0_8, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-27 21:09:17,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L776-->L776-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1898738507 256)))) (or (and (not .cse0) (= ~z$w_buff0~0_In-1898738507 |P2Thread1of1ForFork0_#t~ite9_Out-1898738507|) (= |P2Thread1of1ForFork0_#t~ite8_In-1898738507| |P2Thread1of1ForFork0_#t~ite8_Out-1898738507|)) (and .cse0 (= ~z$w_buff0~0_In-1898738507 |P2Thread1of1ForFork0_#t~ite8_Out-1898738507|) (= |P2Thread1of1ForFork0_#t~ite9_Out-1898738507| |P2Thread1of1ForFork0_#t~ite8_Out-1898738507|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1898738507 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In-1898738507 256) 0) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1898738507 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1898738507 256))))))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In-1898738507|, ~z$w_buff0~0=~z$w_buff0~0_In-1898738507, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1898738507, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1898738507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1898738507, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1898738507, ~weak$$choice2~0=~weak$$choice2~0_In-1898738507} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out-1898738507|, ~z$w_buff0~0=~z$w_buff0~0_In-1898738507, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1898738507, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1898738507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1898738507, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1898738507, ~weak$$choice2~0=~weak$$choice2~0_In-1898738507, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out-1898738507|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 21:09:17,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In192100040 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_In192100040| |P2Thread1of1ForFork0_#t~ite11_Out192100040|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite12_Out192100040| ~z$w_buff1~0_In192100040)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite11_Out192100040| ~z$w_buff1~0_In192100040) (= |P2Thread1of1ForFork0_#t~ite12_Out192100040| |P2Thread1of1ForFork0_#t~ite11_Out192100040|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In192100040 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In192100040 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In192100040 256) 0)) (= (mod ~z$w_buff0_used~0_In192100040 256) 0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In192100040, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In192100040|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In192100040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In192100040, ~z$w_buff1~0=~z$w_buff1~0_In192100040, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In192100040, ~weak$$choice2~0=~weak$$choice2~0_In192100040} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out192100040|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In192100040, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out192100040|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In192100040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In192100040, ~z$w_buff1~0=~z$w_buff1~0_In192100040, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In192100040, ~weak$$choice2~0=~weak$$choice2~0_In192100040} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 21:09:17,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In645107008 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite14_In645107008| |P2Thread1of1ForFork0_#t~ite14_Out645107008|) (= ~z$w_buff0_used~0_In645107008 |P2Thread1of1ForFork0_#t~ite15_Out645107008|)) (and (= |P2Thread1of1ForFork0_#t~ite15_Out645107008| |P2Thread1of1ForFork0_#t~ite14_Out645107008|) .cse0 (= ~z$w_buff0_used~0_In645107008 |P2Thread1of1ForFork0_#t~ite14_Out645107008|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In645107008 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In645107008 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In645107008 256) 0)) (= (mod ~z$w_buff0_used~0_In645107008 256) 0)))))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In645107008|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In645107008, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In645107008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In645107008, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In645107008, ~weak$$choice2~0=~weak$$choice2~0_In645107008} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out645107008|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out645107008|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In645107008, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In645107008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In645107008, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In645107008, ~weak$$choice2~0=~weak$$choice2~0_In645107008} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-27 21:09:17,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (= v_~z$r_buff0_thd3~0_43 v_~z$r_buff0_thd3~0_42) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 21:09:17,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-799320611 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-799320611 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork1_#t~ite28_Out-799320611|)) (and (= ~z$w_buff0_used~0_In-799320611 |P3Thread1of1ForFork1_#t~ite28_Out-799320611|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-799320611, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-799320611} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-799320611, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-799320611|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-799320611} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 21:09:17,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~z~0_12 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:09:17,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1785694748 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1785694748 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1785694748 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1785694748 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out1785694748|)) (and (= ~z$w_buff1_used~0_In1785694748 |P3Thread1of1ForFork1_#t~ite29_Out1785694748|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1785694748, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1785694748, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1785694748, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1785694748} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1785694748, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1785694748|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1785694748, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1785694748, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1785694748} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 21:09:17,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In901316987 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In901316987 256)))) (or (and (= ~z$r_buff0_thd4~0_Out901316987 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out901316987 ~z$r_buff0_thd4~0_In901316987) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In901316987, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In901316987} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In901316987, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out901316987, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out901316987|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 21:09:17,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-339688899 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-339688899 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-339688899 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-339688899 256)))) (or (and (= |P3Thread1of1ForFork1_#t~ite31_Out-339688899| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork1_#t~ite31_Out-339688899| ~z$r_buff1_thd4~0_In-339688899)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-339688899, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-339688899, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-339688899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-339688899} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-339688899, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-339688899, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-339688899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-339688899, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-339688899|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 21:09:17,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd4~0_12 |v_P3Thread1of1ForFork1_#t~ite31_8|) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_8|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 21:09:17,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:09:17,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1453255604 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1453255604 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In1453255604 |ULTIMATE.start_main_#t~ite36_Out1453255604|)) (and (= ~z$w_buff1~0_In1453255604 |ULTIMATE.start_main_#t~ite36_Out1453255604|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1453255604, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1453255604, ~z$w_buff1~0=~z$w_buff1~0_In1453255604, ~z~0=~z~0_In1453255604} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1453255604, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1453255604, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1453255604|, ~z$w_buff1~0=~z$w_buff1~0_In1453255604, ~z~0=~z~0_In1453255604} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 21:09:17,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_14 |v_ULTIMATE.start_main_#t~ite36_8|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_8|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 21:09:17,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1808529623 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1808529623 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1808529623 |ULTIMATE.start_main_#t~ite38_Out-1808529623|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1808529623| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1808529623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1808529623} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1808529623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1808529623, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1808529623|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:09:17,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1187181763 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1187181763 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1187181763 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1187181763 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1187181763 |ULTIMATE.start_main_#t~ite39_Out1187181763|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite39_Out1187181763|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1187181763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1187181763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1187181763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1187181763} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1187181763, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1187181763|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1187181763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1187181763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1187181763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:09:17,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In638530717 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In638530717 256)))) (or (and (= ~z$r_buff0_thd0~0_In638530717 |ULTIMATE.start_main_#t~ite40_Out638530717|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out638530717|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In638530717, ~z$w_buff0_used~0=~z$w_buff0_used~0_In638530717} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In638530717, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out638530717|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In638530717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:09:17,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1902702990 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1902702990 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1902702990 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1902702990 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1902702990| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite41_Out1902702990| ~z$r_buff1_thd0~0_In1902702990) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1902702990, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1902702990, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1902702990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1902702990} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1902702990|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1902702990, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1902702990, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1902702990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1902702990} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 21:09:17,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= v_~main$tmp_guard1~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~x~0_10 2) (= v_~y~0_10 2) (= 1 v_~__unbuffered_p3_EAX~0_9) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= |v_ULTIMATE.start_main_#t~ite41_13| v_~z$r_buff1_thd0~0_14) (= 0 v_~__unbuffered_p3_EBX~0_8)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:09:17,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:09:17 BasicIcfg [2019-12-27 21:09:17,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:09:17,767 INFO L168 Benchmark]: Toolchain (without parser) took 24822.51 ms. Allocated memory was 140.0 MB in the beginning and 1.0 GB in the end (delta: 909.6 MB). Free memory was 102.9 MB in the beginning and 435.9 MB in the end (delta: -332.9 MB). Peak memory consumption was 576.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:09:17,767 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:09:17,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.76 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.5 MB in the beginning and 157.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:09:17,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.46 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 154.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:09:17,769 INFO L168 Benchmark]: Boogie Preprocessor took 37.70 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:09:17,770 INFO L168 Benchmark]: RCFGBuilder took 820.34 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 106.6 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:09:17,771 INFO L168 Benchmark]: TraceAbstraction took 23127.55 ms. Allocated memory was 203.9 MB in the beginning and 1.0 GB in the end (delta: 845.7 MB). Free memory was 106.6 MB in the beginning and 435.9 MB in the end (delta: -329.3 MB). Peak memory consumption was 516.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:09:17,774 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.22 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.76 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.5 MB in the beginning and 157.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.46 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 154.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.70 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.34 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 106.6 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23127.55 ms. Allocated memory was 203.9 MB in the beginning and 1.0 GB in the end (delta: 845.7 MB). Free memory was 106.6 MB in the beginning and 435.9 MB in the end (delta: -329.3 MB). Peak memory consumption was 516.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 169 ProgramPointsBefore, 82 ProgramPointsAfterwards, 191 TransitionsBefore, 88 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 21 ChoiceCompositions, 5425 VarBasedMoverChecksPositive, 133 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50510 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1853 SDtfs, 3014 SDslu, 4748 SDs, 0 SdLazy, 2955 SolverSat, 304 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30990occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 7274 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 52149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...