/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/mix003_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:40:42,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:40:42,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:40:42,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:40:42,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:40:42,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:40:42,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:40:42,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:40:42,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:40:42,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:40:42,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:40:42,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:40:42,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:40:42,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:40:42,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:40:42,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:40:42,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:40:42,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:40:42,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:40:42,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:40:42,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:40:42,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:40:42,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:40:42,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:40:42,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:40:42,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:40:42,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:40:42,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:40:42,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:40:42,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:40:42,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:40:42,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:40:42,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:40:42,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:40:42,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:40:42,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:40:42,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:40:42,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:40:42,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:40:42,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:40:42,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:40:42,754 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 19:40:42,778 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:40:42,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:40:42,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:40:42,781 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:40:42,781 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:40:42,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:40:42,781 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:40:42,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:40:42,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:40:42,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:40:42,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:40:42,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:40:42,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:40:42,784 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:40:42,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:40:42,785 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:40:42,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:40:42,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:40:42,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:40:42,785 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:40:42,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:40:42,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:40:42,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:40:42,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:40:42,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:40:42,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:40:42,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:40:42,787 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:40:42,787 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:40:42,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:40:42,789 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:40:42,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:40:43,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:40:43,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:40:43,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:40:43,139 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:40:43,140 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:40:43,141 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i [2019-12-27 19:40:43,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63af0660c/977c034764b64438a1d4924b045436a0/FLAGf240f199a [2019-12-27 19:40:43,735 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:40:43,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i [2019-12-27 19:40:43,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63af0660c/977c034764b64438a1d4924b045436a0/FLAGf240f199a [2019-12-27 19:40:44,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63af0660c/977c034764b64438a1d4924b045436a0 [2019-12-27 19:40:44,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:40:44,053 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:40:44,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:40:44,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:40:44,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:40:44,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:40:44" (1/1) ... [2019-12-27 19:40:44,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44, skipping insertion in model container [2019-12-27 19:40:44,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:40:44" (1/1) ... [2019-12-27 19:40:44,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:40:44,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:40:44,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:40:44,680 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:40:44,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:40:44,819 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:40:44,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44 WrapperNode [2019-12-27 19:40:44,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:40:44,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:40:44,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:40:44,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:40:44,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44" (1/1) ... [2019-12-27 19:40:44,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44" (1/1) ... [2019-12-27 19:40:44,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:40:44,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:40:44,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:40:44,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:40:44,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44" (1/1) ... [2019-12-27 19:40:44,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44" (1/1) ... [2019-12-27 19:40:44,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44" (1/1) ... [2019-12-27 19:40:44,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44" (1/1) ... [2019-12-27 19:40:44,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44" (1/1) ... [2019-12-27 19:40:44,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44" (1/1) ... [2019-12-27 19:40:44,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44" (1/1) ... [2019-12-27 19:40:44,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:40:44,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:40:44,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:40:44,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:40:44,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44" (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 19:40:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:40:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:40:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:40:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:40:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:40:45,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:40:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:40:45,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:40:45,011 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:40:45,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:40:45,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:40:45,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:40:45,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:40:45,014 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 19:40:45,780 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:40:45,781 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:40:45,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:40:45 BoogieIcfgContainer [2019-12-27 19:40:45,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:40:45,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:40:45,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:40:45,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:40:45,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:40:44" (1/3) ... [2019-12-27 19:40:45,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3739330d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:40:45, skipping insertion in model container [2019-12-27 19:40:45,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:44" (2/3) ... [2019-12-27 19:40:45,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3739330d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:40:45, skipping insertion in model container [2019-12-27 19:40:45,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:40:45" (3/3) ... [2019-12-27 19:40:45,793 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_power.oepc.i [2019-12-27 19:40:45,804 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:40:45,804 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:40:45,815 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:40:45,816 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:40:45,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,886 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,886 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,886 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,887 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,887 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,901 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,901 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,927 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,929 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:45,962 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:40:45,982 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:40:45,982 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:40:45,982 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:40:45,983 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:40:45,983 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:40:45,983 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:40:45,983 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:40:45,983 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:40:46,005 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 19:40:46,007 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 19:40:46,110 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 19:40:46,110 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:40:46,126 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:40:46,152 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 19:40:46,206 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 19:40:46,206 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:40:46,214 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:40:46,235 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 19:40:46,236 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:40:49,790 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 19:40:49,930 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 19:40:49,953 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85139 [2019-12-27 19:40:49,954 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 19:40:49,958 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-27 19:41:07,993 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115082 states. [2019-12-27 19:41:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 115082 states. [2019-12-27 19:41:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:41:08,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:08,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:41:08,002 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-27 19:41:08,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:08,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31552529] [2019-12-27 19:41:08,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:08,237 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 19:41:08,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31552529] [2019-12-27 19:41:08,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:08,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:41:08,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [420861923] [2019-12-27 19:41:08,241 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:08,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:08,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:41:08,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:08,262 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:41:08,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:41:08,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:08,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:41:08,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:41:08,280 INFO L87 Difference]: Start difference. First operand 115082 states. Second operand 3 states. [2019-12-27 19:41:11,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:11,611 INFO L93 Difference]: Finished difference Result 114348 states and 491658 transitions. [2019-12-27 19:41:11,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:41:11,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:41:11,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:12,362 INFO L225 Difference]: With dead ends: 114348 [2019-12-27 19:41:12,369 INFO L226 Difference]: Without dead ends: 107250 [2019-12-27 19:41:12,371 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 19:41:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107250 states. [2019-12-27 19:41:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107250 to 107250. [2019-12-27 19:41:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107250 states. [2019-12-27 19:41:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107250 states to 107250 states and 460523 transitions. [2019-12-27 19:41:22,150 INFO L78 Accepts]: Start accepts. Automaton has 107250 states and 460523 transitions. Word has length 3 [2019-12-27 19:41:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:22,150 INFO L462 AbstractCegarLoop]: Abstraction has 107250 states and 460523 transitions. [2019-12-27 19:41:22,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:41:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 107250 states and 460523 transitions. [2019-12-27 19:41:22,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:41:22,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:22,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:22,155 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:22,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:22,155 INFO L82 PathProgramCache]: Analyzing trace with hash -906390211, now seen corresponding path program 1 times [2019-12-27 19:41:22,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:22,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699152528] [2019-12-27 19:41:22,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:22,322 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 19:41:22,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699152528] [2019-12-27 19:41:22,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:22,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:41:22,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1479930776] [2019-12-27 19:41:22,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:22,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:22,331 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:41:22,331 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:22,333 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:41:22,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:41:22,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:22,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:41:22,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:41:22,335 INFO L87 Difference]: Start difference. First operand 107250 states and 460523 transitions. Second operand 4 states. [2019-12-27 19:41:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:27,395 INFO L93 Difference]: Finished difference Result 171260 states and 704759 transitions. [2019-12-27 19:41:27,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:41:27,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 19:41:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:28,670 INFO L225 Difference]: With dead ends: 171260 [2019-12-27 19:41:28,670 INFO L226 Difference]: Without dead ends: 171211 [2019-12-27 19:41:28,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:41:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171211 states. [2019-12-27 19:41:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171211 to 155734. [2019-12-27 19:41:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155734 states. [2019-12-27 19:41:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155734 states to 155734 states and 649769 transitions. [2019-12-27 19:41:43,158 INFO L78 Accepts]: Start accepts. Automaton has 155734 states and 649769 transitions. Word has length 11 [2019-12-27 19:41:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:43,159 INFO L462 AbstractCegarLoop]: Abstraction has 155734 states and 649769 transitions. [2019-12-27 19:41:43,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:41:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 155734 states and 649769 transitions. [2019-12-27 19:41:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:41:43,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:43,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:43,166 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:43,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:43,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1306732541, now seen corresponding path program 1 times [2019-12-27 19:41:43,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:43,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685546979] [2019-12-27 19:41:43,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:43,218 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 19:41:43,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685546979] [2019-12-27 19:41:43,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:43,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:41:43,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [896651590] [2019-12-27 19:41:43,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:43,224 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:43,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:41:43,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:43,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:41:43,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:41:43,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:41:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:41:43,230 INFO L87 Difference]: Start difference. First operand 155734 states and 649769 transitions. Second operand 3 states. [2019-12-27 19:41:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:43,390 INFO L93 Difference]: Finished difference Result 34176 states and 112026 transitions. [2019-12-27 19:41:43,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:41:43,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 19:41:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:43,450 INFO L225 Difference]: With dead ends: 34176 [2019-12-27 19:41:43,450 INFO L226 Difference]: Without dead ends: 34176 [2019-12-27 19:41:43,451 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 19:41:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34176 states. [2019-12-27 19:41:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34176 to 34176. [2019-12-27 19:41:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34176 states. [2019-12-27 19:41:45,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34176 states to 34176 states and 112026 transitions. [2019-12-27 19:41:45,243 INFO L78 Accepts]: Start accepts. Automaton has 34176 states and 112026 transitions. Word has length 13 [2019-12-27 19:41:45,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:45,243 INFO L462 AbstractCegarLoop]: Abstraction has 34176 states and 112026 transitions. [2019-12-27 19:41:45,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:41:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand 34176 states and 112026 transitions. [2019-12-27 19:41:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:41:45,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:45,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:45,247 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:45,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:45,247 INFO L82 PathProgramCache]: Analyzing trace with hash 54051154, now seen corresponding path program 1 times [2019-12-27 19:41:45,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:45,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868854676] [2019-12-27 19:41:45,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:45,356 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 19:41:45,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868854676] [2019-12-27 19:41:45,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:45,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:41:45,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520017691] [2019-12-27 19:41:45,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:45,361 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:45,364 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:41:45,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:45,364 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:41:45,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:41:45,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:45,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:41:45,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:41:45,366 INFO L87 Difference]: Start difference. First operand 34176 states and 112026 transitions. Second operand 4 states. [2019-12-27 19:41:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:45,769 INFO L93 Difference]: Finished difference Result 42178 states and 136956 transitions. [2019-12-27 19:41:45,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:41:45,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 19:41:45,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:45,839 INFO L225 Difference]: With dead ends: 42178 [2019-12-27 19:41:45,840 INFO L226 Difference]: Without dead ends: 42178 [2019-12-27 19:41:45,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:41:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42178 states. [2019-12-27 19:41:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42178 to 38132. [2019-12-27 19:41:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38132 states. [2019-12-27 19:41:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38132 states to 38132 states and 124449 transitions. [2019-12-27 19:41:46,545 INFO L78 Accepts]: Start accepts. Automaton has 38132 states and 124449 transitions. Word has length 16 [2019-12-27 19:41:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:46,547 INFO L462 AbstractCegarLoop]: Abstraction has 38132 states and 124449 transitions. [2019-12-27 19:41:46,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:41:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 38132 states and 124449 transitions. [2019-12-27 19:41:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:41:46,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:46,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:46,550 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:46,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash 53948296, now seen corresponding path program 1 times [2019-12-27 19:41:46,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:46,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842550240] [2019-12-27 19:41:46,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:46,595 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 19:41:46,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842550240] [2019-12-27 19:41:46,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:46,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:41:46,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [261154960] [2019-12-27 19:41:46,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:46,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:46,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:41:46,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:46,601 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:41:46,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:41:46,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:46,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:41:46,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:41:46,602 INFO L87 Difference]: Start difference. First operand 38132 states and 124449 transitions. Second operand 3 states. [2019-12-27 19:41:46,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:46,817 INFO L93 Difference]: Finished difference Result 55464 states and 180253 transitions. [2019-12-27 19:41:46,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:41:46,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 19:41:46,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:49,237 INFO L225 Difference]: With dead ends: 55464 [2019-12-27 19:41:49,237 INFO L226 Difference]: Without dead ends: 55464 [2019-12-27 19:41:49,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:41:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55464 states. [2019-12-27 19:41:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55464 to 42552. [2019-12-27 19:41:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42552 states. [2019-12-27 19:41:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42552 states to 42552 states and 139903 transitions. [2019-12-27 19:41:50,057 INFO L78 Accepts]: Start accepts. Automaton has 42552 states and 139903 transitions. Word has length 16 [2019-12-27 19:41:50,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:50,057 INFO L462 AbstractCegarLoop]: Abstraction has 42552 states and 139903 transitions. [2019-12-27 19:41:50,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:41:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 42552 states and 139903 transitions. [2019-12-27 19:41:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:41:50,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:50,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:50,060 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:50,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1761611220, now seen corresponding path program 1 times [2019-12-27 19:41:50,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:50,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591423612] [2019-12-27 19:41:50,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:50,130 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 19:41:50,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591423612] [2019-12-27 19:41:50,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:50,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:41:50,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [98974498] [2019-12-27 19:41:50,131 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:50,136 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:50,138 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:41:50,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:50,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:41:50,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:41:50,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:50,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:41:50,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:41:50,139 INFO L87 Difference]: Start difference. First operand 42552 states and 139903 transitions. Second operand 4 states. [2019-12-27 19:41:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:50,543 INFO L93 Difference]: Finished difference Result 50497 states and 164640 transitions. [2019-12-27 19:41:50,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:41:50,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 19:41:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:50,635 INFO L225 Difference]: With dead ends: 50497 [2019-12-27 19:41:50,635 INFO L226 Difference]: Without dead ends: 50497 [2019-12-27 19:41:50,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:41:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50497 states. [2019-12-27 19:41:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50497 to 44016. [2019-12-27 19:41:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44016 states. [2019-12-27 19:41:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44016 states to 44016 states and 144770 transitions. [2019-12-27 19:41:51,793 INFO L78 Accepts]: Start accepts. Automaton has 44016 states and 144770 transitions. Word has length 16 [2019-12-27 19:41:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:51,793 INFO L462 AbstractCegarLoop]: Abstraction has 44016 states and 144770 transitions. [2019-12-27 19:41:51,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:41:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 44016 states and 144770 transitions. [2019-12-27 19:41:51,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:41:51,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:51,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:51,803 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:51,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:51,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1491539652, now seen corresponding path program 1 times [2019-12-27 19:41:51,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:51,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936954702] [2019-12-27 19:41:51,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:51,937 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 19:41:51,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936954702] [2019-12-27 19:41:51,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:51,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:41:51,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [695194910] [2019-12-27 19:41:51,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:51,944 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:51,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 19:41:51,955 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:52,010 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:41:52,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:41:52,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:52,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:41:52,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:41:52,011 INFO L87 Difference]: Start difference. First operand 44016 states and 144770 transitions. Second operand 6 states. [2019-12-27 19:41:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:52,764 INFO L93 Difference]: Finished difference Result 60577 states and 194051 transitions. [2019-12-27 19:41:52,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:41:52,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 19:41:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:52,876 INFO L225 Difference]: With dead ends: 60577 [2019-12-27 19:41:52,876 INFO L226 Difference]: Without dead ends: 60570 [2019-12-27 19:41:52,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:41:53,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60570 states. [2019-12-27 19:41:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60570 to 45150. [2019-12-27 19:41:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45150 states. [2019-12-27 19:41:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45150 states to 45150 states and 148226 transitions. [2019-12-27 19:41:54,126 INFO L78 Accepts]: Start accepts. Automaton has 45150 states and 148226 transitions. Word has length 22 [2019-12-27 19:41:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:54,127 INFO L462 AbstractCegarLoop]: Abstraction has 45150 states and 148226 transitions. [2019-12-27 19:41:54,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:41:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 45150 states and 148226 transitions. [2019-12-27 19:41:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:41:54,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:54,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:54,136 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash 987765270, now seen corresponding path program 1 times [2019-12-27 19:41:54,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:54,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525487274] [2019-12-27 19:41:54,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:41:54,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525487274] [2019-12-27 19:41:54,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:54,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:41:54,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [285469605] [2019-12-27 19:41:54,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:54,216 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:54,222 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 19:41:54,222 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:54,244 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:41:54,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:41:54,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:54,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:41:54,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:41:54,246 INFO L87 Difference]: Start difference. First operand 45150 states and 148226 transitions. Second operand 6 states. [2019-12-27 19:41:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:55,002 INFO L93 Difference]: Finished difference Result 63824 states and 203774 transitions. [2019-12-27 19:41:55,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:41:55,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 19:41:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:55,110 INFO L225 Difference]: With dead ends: 63824 [2019-12-27 19:41:55,110 INFO L226 Difference]: Without dead ends: 63817 [2019-12-27 19:41:55,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:41:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63817 states. [2019-12-27 19:41:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63817 to 43599. [2019-12-27 19:41:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43599 states. [2019-12-27 19:41:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43599 states to 43599 states and 143212 transitions. [2019-12-27 19:41:56,555 INFO L78 Accepts]: Start accepts. Automaton has 43599 states and 143212 transitions. Word has length 22 [2019-12-27 19:41:56,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:56,556 INFO L462 AbstractCegarLoop]: Abstraction has 43599 states and 143212 transitions. [2019-12-27 19:41:56,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:41:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 43599 states and 143212 transitions. [2019-12-27 19:41:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:41:56,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:56,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:56,568 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1953235153, now seen corresponding path program 1 times [2019-12-27 19:41:56,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:56,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243070721] [2019-12-27 19:41:56,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:56,615 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 19:41:56,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243070721] [2019-12-27 19:41:56,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:56,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:41:56,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [834604366] [2019-12-27 19:41:56,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:56,619 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:56,628 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:41:56,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:56,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:41:56,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:41:56,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:56,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:41:56,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:41:56,641 INFO L87 Difference]: Start difference. First operand 43599 states and 143212 transitions. Second operand 5 states. [2019-12-27 19:41:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:56,741 INFO L93 Difference]: Finished difference Result 17791 states and 55309 transitions. [2019-12-27 19:41:56,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:41:56,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 19:41:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:56,768 INFO L225 Difference]: With dead ends: 17791 [2019-12-27 19:41:56,768 INFO L226 Difference]: Without dead ends: 17791 [2019-12-27 19:41:56,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:41:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17791 states. [2019-12-27 19:41:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17791 to 17428. [2019-12-27 19:41:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17428 states. [2019-12-27 19:41:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17428 states to 17428 states and 54273 transitions. [2019-12-27 19:41:57,058 INFO L78 Accepts]: Start accepts. Automaton has 17428 states and 54273 transitions. Word has length 25 [2019-12-27 19:41:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:57,059 INFO L462 AbstractCegarLoop]: Abstraction has 17428 states and 54273 transitions. [2019-12-27 19:41:57,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:41:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 17428 states and 54273 transitions. [2019-12-27 19:41:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:41:57,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:57,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:57,073 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:57,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:57,073 INFO L82 PathProgramCache]: Analyzing trace with hash 451000002, now seen corresponding path program 1 times [2019-12-27 19:41:57,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:57,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118620338] [2019-12-27 19:41:57,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:57,117 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 19:41:57,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118620338] [2019-12-27 19:41:57,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:57,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:41:57,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [163202197] [2019-12-27 19:41:57,118 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:57,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:57,127 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:41:57,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:57,128 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:41:57,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:41:57,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:57,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:41:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:41:57,129 INFO L87 Difference]: Start difference. First operand 17428 states and 54273 transitions. Second operand 3 states. [2019-12-27 19:41:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:57,227 INFO L93 Difference]: Finished difference Result 22857 states and 67585 transitions. [2019-12-27 19:41:57,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:41:57,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 19:41:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:57,257 INFO L225 Difference]: With dead ends: 22857 [2019-12-27 19:41:57,257 INFO L226 Difference]: Without dead ends: 22857 [2019-12-27 19:41:57,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:41:57,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22857 states. [2019-12-27 19:41:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22857 to 17428. [2019-12-27 19:41:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17428 states. [2019-12-27 19:41:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17428 states to 17428 states and 51895 transitions. [2019-12-27 19:41:57,562 INFO L78 Accepts]: Start accepts. Automaton has 17428 states and 51895 transitions. Word has length 27 [2019-12-27 19:41:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:57,562 INFO L462 AbstractCegarLoop]: Abstraction has 17428 states and 51895 transitions. [2019-12-27 19:41:57,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:41:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 17428 states and 51895 transitions. [2019-12-27 19:41:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:41:57,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:57,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:57,574 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:57,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:57,575 INFO L82 PathProgramCache]: Analyzing trace with hash -319576223, now seen corresponding path program 1 times [2019-12-27 19:41:57,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:57,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398476012] [2019-12-27 19:41:57,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:57,664 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 19:41:57,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398476012] [2019-12-27 19:41:57,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:57,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:41:57,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [236719281] [2019-12-27 19:41:57,665 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:57,669 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:57,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:41:57,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:57,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:41:57,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:41:57,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:57,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:41:57,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:41:57,676 INFO L87 Difference]: Start difference. First operand 17428 states and 51895 transitions. Second operand 5 states. [2019-12-27 19:41:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:58,095 INFO L93 Difference]: Finished difference Result 21434 states and 63020 transitions. [2019-12-27 19:41:58,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:41:58,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 19:41:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:58,132 INFO L225 Difference]: With dead ends: 21434 [2019-12-27 19:41:58,133 INFO L226 Difference]: Without dead ends: 21434 [2019-12-27 19:41:58,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:41:58,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21434 states. [2019-12-27 19:41:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21434 to 20103. [2019-12-27 19:41:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20103 states. [2019-12-27 19:41:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20103 states to 20103 states and 59665 transitions. [2019-12-27 19:41:58,448 INFO L78 Accepts]: Start accepts. Automaton has 20103 states and 59665 transitions. Word has length 27 [2019-12-27 19:41:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:58,449 INFO L462 AbstractCegarLoop]: Abstraction has 20103 states and 59665 transitions. [2019-12-27 19:41:58,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:41:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 20103 states and 59665 transitions. [2019-12-27 19:41:58,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 19:41:58,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:58,465 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] [2019-12-27 19:41:58,465 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:58,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:58,465 INFO L82 PathProgramCache]: Analyzing trace with hash -19850815, now seen corresponding path program 1 times [2019-12-27 19:41:58,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:58,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422601755] [2019-12-27 19:41:58,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:58,549 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 19:41:58,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422601755] [2019-12-27 19:41:58,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:58,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:41:58,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [388165282] [2019-12-27 19:41:58,551 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:58,556 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:58,563 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 19:41:58,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:58,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:41:58,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:41:58,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:58,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:41:58,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:41:58,565 INFO L87 Difference]: Start difference. First operand 20103 states and 59665 transitions. Second operand 5 states. [2019-12-27 19:41:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:58,724 INFO L93 Difference]: Finished difference Result 20407 states and 60436 transitions. [2019-12-27 19:41:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:41:58,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 19:41:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:58,770 INFO L225 Difference]: With dead ends: 20407 [2019-12-27 19:41:58,770 INFO L226 Difference]: Without dead ends: 20407 [2019-12-27 19:41:58,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 19:41:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20407 states. [2019-12-27 19:41:59,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20407 to 20407. [2019-12-27 19:41:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20407 states. [2019-12-27 19:41:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20407 states to 20407 states and 60436 transitions. [2019-12-27 19:41:59,418 INFO L78 Accepts]: Start accepts. Automaton has 20407 states and 60436 transitions. Word has length 28 [2019-12-27 19:41:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:59,421 INFO L462 AbstractCegarLoop]: Abstraction has 20407 states and 60436 transitions. [2019-12-27 19:41:59,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:41:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 20407 states and 60436 transitions. [2019-12-27 19:41:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 19:41:59,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:59,450 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] [2019-12-27 19:41:59,450 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:59,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1237552585, now seen corresponding path program 1 times [2019-12-27 19:41:59,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:59,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719311713] [2019-12-27 19:41:59,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:59,590 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 19:41:59,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719311713] [2019-12-27 19:41:59,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:59,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:41:59,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1985685062] [2019-12-27 19:41:59,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:59,601 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:59,612 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 19:41:59,612 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:59,612 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:41:59,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:41:59,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:59,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:41:59,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:41:59,614 INFO L87 Difference]: Start difference. First operand 20407 states and 60436 transitions. Second operand 5 states. [2019-12-27 19:42:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:00,018 INFO L93 Difference]: Finished difference Result 23784 states and 69539 transitions. [2019-12-27 19:42:00,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:42:00,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 19:42:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:00,060 INFO L225 Difference]: With dead ends: 23784 [2019-12-27 19:42:00,060 INFO L226 Difference]: Without dead ends: 23784 [2019-12-27 19:42:00,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:42:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23784 states. [2019-12-27 19:42:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23784 to 20614. [2019-12-27 19:42:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20614 states. [2019-12-27 19:42:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20614 states to 20614 states and 60980 transitions. [2019-12-27 19:42:00,410 INFO L78 Accepts]: Start accepts. Automaton has 20614 states and 60980 transitions. Word has length 29 [2019-12-27 19:42:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:00,410 INFO L462 AbstractCegarLoop]: Abstraction has 20614 states and 60980 transitions. [2019-12-27 19:42:00,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:42:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 20614 states and 60980 transitions. [2019-12-27 19:42:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:42:00,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:00,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:00,432 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash 900090167, now seen corresponding path program 1 times [2019-12-27 19:42:00,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:00,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132796653] [2019-12-27 19:42:00,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:00,520 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 19:42:00,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132796653] [2019-12-27 19:42:00,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:00,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:42:00,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [90964430] [2019-12-27 19:42:00,521 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:00,526 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:00,538 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 19:42:00,538 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:00,568 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:42:00,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:42:00,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:00,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:42:00,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:42:00,569 INFO L87 Difference]: Start difference. First operand 20614 states and 60980 transitions. Second operand 7 states. [2019-12-27 19:42:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:01,449 INFO L93 Difference]: Finished difference Result 27479 states and 79870 transitions. [2019-12-27 19:42:01,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:42:01,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 19:42:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:01,487 INFO L225 Difference]: With dead ends: 27479 [2019-12-27 19:42:01,487 INFO L226 Difference]: Without dead ends: 27479 [2019-12-27 19:42:01,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:42:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27479 states. [2019-12-27 19:42:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27479 to 21693. [2019-12-27 19:42:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21693 states. [2019-12-27 19:42:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21693 states to 21693 states and 64090 transitions. [2019-12-27 19:42:01,873 INFO L78 Accepts]: Start accepts. Automaton has 21693 states and 64090 transitions. Word has length 33 [2019-12-27 19:42:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:01,873 INFO L462 AbstractCegarLoop]: Abstraction has 21693 states and 64090 transitions. [2019-12-27 19:42:01,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:42:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 21693 states and 64090 transitions. [2019-12-27 19:42:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 19:42:01,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:01,892 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] [2019-12-27 19:42:01,892 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:01,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:01,893 INFO L82 PathProgramCache]: Analyzing trace with hash 810881567, now seen corresponding path program 1 times [2019-12-27 19:42:01,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:01,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074650120] [2019-12-27 19:42:01,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:42:01,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074650120] [2019-12-27 19:42:01,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:01,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:42:01,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [657913658] [2019-12-27 19:42:01,991 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:01,998 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:02,013 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 63 transitions. [2019-12-27 19:42:02,013 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:02,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:42:02,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:42:02,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:02,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:42:02,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:42:02,040 INFO L87 Difference]: Start difference. First operand 21693 states and 64090 transitions. Second operand 7 states. [2019-12-27 19:42:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:03,022 INFO L93 Difference]: Finished difference Result 26605 states and 77567 transitions. [2019-12-27 19:42:03,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:42:03,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 19:42:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:03,061 INFO L225 Difference]: With dead ends: 26605 [2019-12-27 19:42:03,061 INFO L226 Difference]: Without dead ends: 26605 [2019-12-27 19:42:03,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:42:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26605 states. [2019-12-27 19:42:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26605 to 18643. [2019-12-27 19:42:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18643 states. [2019-12-27 19:42:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18643 states to 18643 states and 55403 transitions. [2019-12-27 19:42:03,395 INFO L78 Accepts]: Start accepts. Automaton has 18643 states and 55403 transitions. Word has length 35 [2019-12-27 19:42:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:03,395 INFO L462 AbstractCegarLoop]: Abstraction has 18643 states and 55403 transitions. [2019-12-27 19:42:03,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:42:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 18643 states and 55403 transitions. [2019-12-27 19:42:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 19:42:03,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:03,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:03,414 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:03,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:03,414 INFO L82 PathProgramCache]: Analyzing trace with hash 173355914, now seen corresponding path program 1 times [2019-12-27 19:42:03,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:03,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23] [2019-12-27 19:42:03,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:03,468 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 19:42:03,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23] [2019-12-27 19:42:03,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:03,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:42:03,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [806776376] [2019-12-27 19:42:03,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:03,477 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:03,521 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 231 transitions. [2019-12-27 19:42:03,521 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:03,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:03,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:03,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:03,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:03,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:03,523 INFO L87 Difference]: Start difference. First operand 18643 states and 55403 transitions. Second operand 3 states. [2019-12-27 19:42:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:03,598 INFO L93 Difference]: Finished difference Result 18642 states and 55401 transitions. [2019-12-27 19:42:03,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:03,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 19:42:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:03,626 INFO L225 Difference]: With dead ends: 18642 [2019-12-27 19:42:03,627 INFO L226 Difference]: Without dead ends: 18642 [2019-12-27 19:42:03,627 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 19:42:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18642 states. [2019-12-27 19:42:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18642 to 18642. [2019-12-27 19:42:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18642 states. [2019-12-27 19:42:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18642 states to 18642 states and 55401 transitions. [2019-12-27 19:42:03,919 INFO L78 Accepts]: Start accepts. Automaton has 18642 states and 55401 transitions. Word has length 39 [2019-12-27 19:42:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:03,919 INFO L462 AbstractCegarLoop]: Abstraction has 18642 states and 55401 transitions. [2019-12-27 19:42:03,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:42:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 18642 states and 55401 transitions. [2019-12-27 19:42:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 19:42:03,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:03,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:03,943 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:03,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:03,943 INFO L82 PathProgramCache]: Analyzing trace with hash -121906311, now seen corresponding path program 1 times [2019-12-27 19:42:03,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:03,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241945630] [2019-12-27 19:42:03,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:04,006 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 19:42:04,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241945630] [2019-12-27 19:42:04,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:04,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:42:04,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682116143] [2019-12-27 19:42:04,007 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:04,015 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:04,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 276 transitions. [2019-12-27 19:42:04,076 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:04,085 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:42:04,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:42:04,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:04,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:42:04,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:42:04,086 INFO L87 Difference]: Start difference. First operand 18642 states and 55401 transitions. Second operand 4 states. [2019-12-27 19:42:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:04,412 INFO L93 Difference]: Finished difference Result 27440 states and 79592 transitions. [2019-12-27 19:42:04,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:42:04,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 19:42:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:04,447 INFO L225 Difference]: With dead ends: 27440 [2019-12-27 19:42:04,448 INFO L226 Difference]: Without dead ends: 27440 [2019-12-27 19:42:04,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:42:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27440 states. [2019-12-27 19:42:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27440 to 18634. [2019-12-27 19:42:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18634 states. [2019-12-27 19:42:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18634 states to 18634 states and 54671 transitions. [2019-12-27 19:42:04,796 INFO L78 Accepts]: Start accepts. Automaton has 18634 states and 54671 transitions. Word has length 40 [2019-12-27 19:42:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:04,796 INFO L462 AbstractCegarLoop]: Abstraction has 18634 states and 54671 transitions. [2019-12-27 19:42:04,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:42:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 18634 states and 54671 transitions. [2019-12-27 19:42:04,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 19:42:04,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:04,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:04,822 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:04,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:04,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1092762268, now seen corresponding path program 1 times [2019-12-27 19:42:04,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:04,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127329299] [2019-12-27 19:42:04,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:04,898 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 19:42:04,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127329299] [2019-12-27 19:42:04,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:04,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:42:04,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1006260296] [2019-12-27 19:42:04,899 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:04,908 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:04,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 237 transitions. [2019-12-27 19:42:04,964 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:04,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:42:04,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:04,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:04,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:04,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:04,967 INFO L87 Difference]: Start difference. First operand 18634 states and 54671 transitions. Second operand 3 states. [2019-12-27 19:42:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:05,035 INFO L93 Difference]: Finished difference Result 18634 states and 54594 transitions. [2019-12-27 19:42:05,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:05,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 19:42:05,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:05,060 INFO L225 Difference]: With dead ends: 18634 [2019-12-27 19:42:05,061 INFO L226 Difference]: Without dead ends: 18634 [2019-12-27 19:42:05,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18634 states. [2019-12-27 19:42:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18634 to 16452. [2019-12-27 19:42:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16452 states. [2019-12-27 19:42:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16452 states to 16452 states and 48592 transitions. [2019-12-27 19:42:05,433 INFO L78 Accepts]: Start accepts. Automaton has 16452 states and 48592 transitions. Word has length 41 [2019-12-27 19:42:05,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:05,433 INFO L462 AbstractCegarLoop]: Abstraction has 16452 states and 48592 transitions. [2019-12-27 19:42:05,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:42:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 16452 states and 48592 transitions. [2019-12-27 19:42:05,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 19:42:05,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:05,449 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] [2019-12-27 19:42:05,449 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash 592584646, now seen corresponding path program 1 times [2019-12-27 19:42:05,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:05,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41481681] [2019-12-27 19:42:05,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:05,500 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 19:42:05,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41481681] [2019-12-27 19:42:05,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:05,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:42:05,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1769380144] [2019-12-27 19:42:05,501 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:05,510 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:05,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 240 transitions. [2019-12-27 19:42:05,569 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:05,613 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:42:05,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:42:05,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:05,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:42:05,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:42:05,615 INFO L87 Difference]: Start difference. First operand 16452 states and 48592 transitions. Second operand 7 states. [2019-12-27 19:42:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:05,695 INFO L93 Difference]: Finished difference Result 15254 states and 46027 transitions. [2019-12-27 19:42:05,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:42:05,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 19:42:05,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:05,717 INFO L225 Difference]: With dead ends: 15254 [2019-12-27 19:42:05,717 INFO L226 Difference]: Without dead ends: 15254 [2019-12-27 19:42:05,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:42:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15254 states. [2019-12-27 19:42:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15254 to 15254. [2019-12-27 19:42:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15254 states. [2019-12-27 19:42:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15254 states to 15254 states and 46027 transitions. [2019-12-27 19:42:05,963 INFO L78 Accepts]: Start accepts. Automaton has 15254 states and 46027 transitions. Word has length 42 [2019-12-27 19:42:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:05,964 INFO L462 AbstractCegarLoop]: Abstraction has 15254 states and 46027 transitions. [2019-12-27 19:42:05,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:42:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 15254 states and 46027 transitions. [2019-12-27 19:42:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:42:05,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:05,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:05,980 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:05,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:05,981 INFO L82 PathProgramCache]: Analyzing trace with hash -269656493, now seen corresponding path program 1 times [2019-12-27 19:42:05,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:05,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934334504] [2019-12-27 19:42:05,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:06,046 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 19:42:06,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934334504] [2019-12-27 19:42:06,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:06,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:42:06,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2144691033] [2019-12-27 19:42:06,047 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:06,069 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:06,242 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 422 transitions. [2019-12-27 19:42:06,242 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:06,244 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:42:06,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:06,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:06,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:06,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:06,245 INFO L87 Difference]: Start difference. First operand 15254 states and 46027 transitions. Second operand 3 states. [2019-12-27 19:42:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:06,335 INFO L93 Difference]: Finished difference Result 17746 states and 53311 transitions. [2019-12-27 19:42:06,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:06,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 19:42:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:06,357 INFO L225 Difference]: With dead ends: 17746 [2019-12-27 19:42:06,358 INFO L226 Difference]: Without dead ends: 17746 [2019-12-27 19:42:06,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 19:42:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17746 states. [2019-12-27 19:42:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17746 to 14015. [2019-12-27 19:42:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14015 states. [2019-12-27 19:42:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14015 states to 14015 states and 42411 transitions. [2019-12-27 19:42:06,609 INFO L78 Accepts]: Start accepts. Automaton has 14015 states and 42411 transitions. Word has length 66 [2019-12-27 19:42:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:06,609 INFO L462 AbstractCegarLoop]: Abstraction has 14015 states and 42411 transitions. [2019-12-27 19:42:06,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:42:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 14015 states and 42411 transitions. [2019-12-27 19:42:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:42:06,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:06,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:06,624 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:06,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:06,624 INFO L82 PathProgramCache]: Analyzing trace with hash -466576635, now seen corresponding path program 1 times [2019-12-27 19:42:06,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:06,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290990704] [2019-12-27 19:42:06,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:06,857 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 19:42:06,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290990704] [2019-12-27 19:42:06,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:06,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:42:06,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [411535906] [2019-12-27 19:42:06,858 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:06,889 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:07,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 427 transitions. [2019-12-27 19:42:07,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:07,392 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:42:07,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:42:07,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:07,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:42:07,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:42:07,393 INFO L87 Difference]: Start difference. First operand 14015 states and 42411 transitions. Second operand 12 states. [2019-12-27 19:42:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:09,489 INFO L93 Difference]: Finished difference Result 29414 states and 88402 transitions. [2019-12-27 19:42:09,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 19:42:09,489 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 19:42:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:09,517 INFO L225 Difference]: With dead ends: 29414 [2019-12-27 19:42:09,518 INFO L226 Difference]: Without dead ends: 20262 [2019-12-27 19:42:09,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:42:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20262 states. [2019-12-27 19:42:09,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20262 to 16785. [2019-12-27 19:42:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16785 states. [2019-12-27 19:42:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16785 states to 16785 states and 50449 transitions. [2019-12-27 19:42:09,816 INFO L78 Accepts]: Start accepts. Automaton has 16785 states and 50449 transitions. Word has length 67 [2019-12-27 19:42:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:09,816 INFO L462 AbstractCegarLoop]: Abstraction has 16785 states and 50449 transitions. [2019-12-27 19:42:09,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:42:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 16785 states and 50449 transitions. [2019-12-27 19:42:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:42:09,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:09,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:09,833 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:09,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:09,834 INFO L82 PathProgramCache]: Analyzing trace with hash -638378747, now seen corresponding path program 2 times [2019-12-27 19:42:09,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:09,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739692748] [2019-12-27 19:42:09,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:10,277 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 19:42:10,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739692748] [2019-12-27 19:42:10,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:10,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:42:10,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1238315756] [2019-12-27 19:42:10,279 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:10,303 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:10,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 262 states and 495 transitions. [2019-12-27 19:42:10,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:10,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:42:10,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 19:42:10,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:10,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 19:42:10,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:42:10,763 INFO L87 Difference]: Start difference. First operand 16785 states and 50449 transitions. Second operand 18 states. [2019-12-27 19:42:13,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:13,694 INFO L93 Difference]: Finished difference Result 25198 states and 74929 transitions. [2019-12-27 19:42:13,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 19:42:13,694 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 19:42:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:13,729 INFO L225 Difference]: With dead ends: 25198 [2019-12-27 19:42:13,729 INFO L226 Difference]: Without dead ends: 20615 [2019-12-27 19:42:13,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=202, Invalid=854, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 19:42:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20615 states. [2019-12-27 19:42:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20615 to 17112. [2019-12-27 19:42:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17112 states. [2019-12-27 19:42:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 51148 transitions. [2019-12-27 19:42:14,039 INFO L78 Accepts]: Start accepts. Automaton has 17112 states and 51148 transitions. Word has length 67 [2019-12-27 19:42:14,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:14,039 INFO L462 AbstractCegarLoop]: Abstraction has 17112 states and 51148 transitions. [2019-12-27 19:42:14,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 19:42:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 17112 states and 51148 transitions. [2019-12-27 19:42:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:42:14,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:14,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:14,057 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:14,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1948834343, now seen corresponding path program 3 times [2019-12-27 19:42:14,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:14,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815947335] [2019-12-27 19:42:14,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:14,415 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 19:42:14,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815947335] [2019-12-27 19:42:14,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:14,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:42:14,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [310556806] [2019-12-27 19:42:14,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:14,443 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:14,688 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 263 states and 518 transitions. [2019-12-27 19:42:14,688 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:15,150 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 19:42:15,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 19:42:15,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:15,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 19:42:15,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-12-27 19:42:15,152 INFO L87 Difference]: Start difference. First operand 17112 states and 51148 transitions. Second operand 21 states. [2019-12-27 19:42:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:22,096 INFO L93 Difference]: Finished difference Result 42187 states and 125848 transitions. [2019-12-27 19:42:22,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 19:42:22,097 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 19:42:22,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:22,142 INFO L225 Difference]: With dead ends: 42187 [2019-12-27 19:42:22,142 INFO L226 Difference]: Without dead ends: 33733 [2019-12-27 19:42:22,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=544, Invalid=2762, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 19:42:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33733 states. [2019-12-27 19:42:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33733 to 21522. [2019-12-27 19:42:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21522 states. [2019-12-27 19:42:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21522 states to 21522 states and 65157 transitions. [2019-12-27 19:42:22,557 INFO L78 Accepts]: Start accepts. Automaton has 21522 states and 65157 transitions. Word has length 67 [2019-12-27 19:42:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:22,558 INFO L462 AbstractCegarLoop]: Abstraction has 21522 states and 65157 transitions. [2019-12-27 19:42:22,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 19:42:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 21522 states and 65157 transitions. [2019-12-27 19:42:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:42:22,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:22,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:22,581 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash -626626987, now seen corresponding path program 4 times [2019-12-27 19:42:22,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:22,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599699303] [2019-12-27 19:42:22,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:23,027 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 19:42:23,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599699303] [2019-12-27 19:42:23,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:23,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:42:23,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932781124] [2019-12-27 19:42:23,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:23,048 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:23,302 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 419 transitions. [2019-12-27 19:42:23,303 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:23,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:42:23,831 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2019-12-27 19:42:23,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:42:24,227 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 19:42:24,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 19:42:24,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:24,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 19:42:24,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2019-12-27 19:42:24,229 INFO L87 Difference]: Start difference. First operand 21522 states and 65157 transitions. Second operand 25 states. [2019-12-27 19:42:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:32,786 INFO L93 Difference]: Finished difference Result 42949 states and 128831 transitions. [2019-12-27 19:42:32,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-27 19:42:32,786 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-12-27 19:42:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:32,845 INFO L225 Difference]: With dead ends: 42949 [2019-12-27 19:42:32,845 INFO L226 Difference]: Without dead ends: 40134 [2019-12-27 19:42:32,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=856, Invalid=5786, Unknown=0, NotChecked=0, Total=6642 [2019-12-27 19:42:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40134 states. [2019-12-27 19:42:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40134 to 22383. [2019-12-27 19:42:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22383 states. [2019-12-27 19:42:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22383 states to 22383 states and 67553 transitions. [2019-12-27 19:42:33,339 INFO L78 Accepts]: Start accepts. Automaton has 22383 states and 67553 transitions. Word has length 67 [2019-12-27 19:42:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:33,339 INFO L462 AbstractCegarLoop]: Abstraction has 22383 states and 67553 transitions. [2019-12-27 19:42:33,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 19:42:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 22383 states and 67553 transitions. [2019-12-27 19:42:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:42:33,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:33,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:33,361 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:33,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:33,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1945162693, now seen corresponding path program 5 times [2019-12-27 19:42:33,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:33,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638590459] [2019-12-27 19:42:33,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:33,769 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 19:42:33,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638590459] [2019-12-27 19:42:33,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:33,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 19:42:33,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1828837359] [2019-12-27 19:42:33,770 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:33,789 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:34,090 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 592 transitions. [2019-12-27 19:42:34,090 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:34,532 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 19:42:34,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 19:42:34,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:34,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 19:42:34,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:42:34,533 INFO L87 Difference]: Start difference. First operand 22383 states and 67553 transitions. Second operand 18 states. [2019-12-27 19:42:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:39,204 INFO L93 Difference]: Finished difference Result 56859 states and 170214 transitions. [2019-12-27 19:42:39,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 19:42:39,205 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 19:42:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:39,270 INFO L225 Difference]: With dead ends: 56859 [2019-12-27 19:42:39,270 INFO L226 Difference]: Without dead ends: 48881 [2019-12-27 19:42:39,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=535, Invalid=3247, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 19:42:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48881 states. [2019-12-27 19:42:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48881 to 22705. [2019-12-27 19:42:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22705 states. [2019-12-27 19:42:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22705 states to 22705 states and 68324 transitions. [2019-12-27 19:42:39,838 INFO L78 Accepts]: Start accepts. Automaton has 22705 states and 68324 transitions. Word has length 67 [2019-12-27 19:42:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:39,838 INFO L462 AbstractCegarLoop]: Abstraction has 22705 states and 68324 transitions. [2019-12-27 19:42:39,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 19:42:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 22705 states and 68324 transitions. [2019-12-27 19:42:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:42:39,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:39,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:39,865 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:39,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:39,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1040963391, now seen corresponding path program 6 times [2019-12-27 19:42:39,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:39,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132060193] [2019-12-27 19:42:39,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:40,671 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 19:42:40,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132060193] [2019-12-27 19:42:40,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:40,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 19:42:40,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9086770] [2019-12-27 19:42:40,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:40,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:41,146 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 470 transitions. [2019-12-27 19:42:41,148 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:41,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 19:42:41,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:42:41,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:42:42,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 39 times. [2019-12-27 19:42:42,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 19:42:42,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:42,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 19:42:42,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:42:42,180 INFO L87 Difference]: Start difference. First operand 22705 states and 68324 transitions. Second operand 27 states. [2019-12-27 19:42:51,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:51,491 INFO L93 Difference]: Finished difference Result 27399 states and 79477 transitions. [2019-12-27 19:42:51,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-27 19:42:51,492 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2019-12-27 19:42:51,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:51,525 INFO L225 Difference]: With dead ends: 27399 [2019-12-27 19:42:51,525 INFO L226 Difference]: Without dead ends: 23921 [2019-12-27 19:42:51,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 20 SyntacticMatches, 21 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=881, Invalid=6429, Unknown=0, NotChecked=0, Total=7310 [2019-12-27 19:42:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23921 states. [2019-12-27 19:42:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23921 to 21005. [2019-12-27 19:42:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21005 states. [2019-12-27 19:42:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21005 states to 21005 states and 62252 transitions. [2019-12-27 19:42:52,030 INFO L78 Accepts]: Start accepts. Automaton has 21005 states and 62252 transitions. Word has length 67 [2019-12-27 19:42:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:52,030 INFO L462 AbstractCegarLoop]: Abstraction has 21005 states and 62252 transitions. [2019-12-27 19:42:52,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 19:42:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 21005 states and 62252 transitions. [2019-12-27 19:42:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:42:52,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:52,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:52,053 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:52,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:52,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1050036249, now seen corresponding path program 7 times [2019-12-27 19:42:52,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:52,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679527746] [2019-12-27 19:42:52,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:42:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:42:52,212 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:42:52,212 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:42:52,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~main$tmp_guard1~0_16 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t62~0.base_27| 1)) (= v_~z$r_buff0_thd3~0_79 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t62~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t62~0.base_27|) |v_ULTIMATE.start_main_~#t62~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_cnt~0_21) (= (select .cse0 |v_ULTIMATE.start_main_~#t62~0.base_27|) 0) (= v_~z$read_delayed~0_6 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$r_buff0_thd0~0_21 0) (= v_~z$w_buff0_used~0_112 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~x~0_10 0) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$r_buff1_thd0~0_23) (= 0 v_~z$w_buff1_used~0_70) (= 0 |v_ULTIMATE.start_main_~#t62~0.offset_19|) (= 0 v_~weak$$choice0~0_7) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t62~0.base_27| 4)) (= v_~__unbuffered_p2_EBX~0_15 0) (= v_~z~0_25 0) (= 0 |v_#NULL.base_7|) (= 0 v_~y~0_8) (= 0 v_~__unbuffered_p0_EAX~0_16) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t62~0.base_27|) (= 0 v_~z$r_buff1_thd3~0_47) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~z$r_buff0_thd2~0_21 0) (= v_~z$r_buff0_thd1~0_28 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t62~0.offset=|v_ULTIMATE.start_main_~#t62~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t64~0.base=|v_ULTIMATE.start_main_~#t64~0.base_18|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~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_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t63~0.base=|v_ULTIMATE.start_main_~#t63~0.base_24|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ULTIMATE.start_main_~#t64~0.offset=|v_ULTIMATE.start_main_~#t64~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t63~0.offset=|v_ULTIMATE.start_main_~#t63~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ULTIMATE.start_main_~#t62~0.base=|v_ULTIMATE.start_main_~#t62~0.base_27|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t62~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t64~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t63~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t64~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t63~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t62~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:42:52,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L750: Formula: (and (= ~z$r_buff0_thd1~0_In1238738503 ~z$r_buff1_thd1~0_Out1238738503) (= ~x~0_In1238738503 ~__unbuffered_p0_EAX~0_Out1238738503) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1238738503)) (= 1 ~z$r_buff0_thd1~0_Out1238738503) (= ~z$r_buff1_thd0~0_Out1238738503 ~z$r_buff0_thd0~0_In1238738503) (= ~z$r_buff1_thd3~0_Out1238738503 ~z$r_buff0_thd3~0_In1238738503) (= ~z$r_buff0_thd2~0_In1238738503 ~z$r_buff1_thd2~0_Out1238738503)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1238738503, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1238738503, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1238738503, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1238738503, ~x~0=~x~0_In1238738503, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1238738503} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1238738503, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1238738503, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1238738503, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1238738503, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1238738503, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1238738503, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1238738503, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1238738503, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1238738503, ~x~0=~x~0_In1238738503, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1238738503} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:42:52,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L832-1-->L834: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t63~0.offset_10|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t63~0.base_11|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t63~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t63~0.base_11|) |v_ULTIMATE.start_main_~#t63~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t63~0.base_11| 1) |v_#valid_39|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t63~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t63~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t63~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t63~0.base=|v_ULTIMATE.start_main_~#t63~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t63~0.offset=|v_ULTIMATE.start_main_~#t63~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t63~0.base, ULTIMATE.start_main_~#t63~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 19:42:52,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L834-1-->L836: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t64~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t64~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t64~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t64~0.base_11|) |v_ULTIMATE.start_main_~#t64~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t64~0.base_11| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t64~0.base_11|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t64~0.base_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t64~0.base_11| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t64~0.base=|v_ULTIMATE.start_main_~#t64~0.base_11|, ULTIMATE.start_main_~#t64~0.offset=|v_ULTIMATE.start_main_~#t64~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t64~0.base, ULTIMATE.start_main_~#t64~0.offset, #length] because there is no mapped edge [2019-12-27 19:42:52,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out-343540644| |P1Thread1of1ForFork2_#t~ite10_Out-343540644|)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-343540644 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-343540644 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out-343540644| ~z$w_buff1~0_In-343540644)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-343540644| ~z~0_In-343540644) .cse1 (or .cse0 .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-343540644, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-343540644, ~z$w_buff1~0=~z$w_buff1~0_In-343540644, ~z~0=~z~0_In-343540644} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-343540644|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-343540644, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-343540644|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-343540644, ~z$w_buff1~0=~z$w_buff1~0_In-343540644, ~z~0=~z~0_In-343540644} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 19:42:52,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In65800289 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In65800289 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out65800289| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out65800289| ~z$w_buff0_used~0_In65800289)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In65800289, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In65800289} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In65800289, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out65800289|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In65800289} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 19:42:52,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-144606444 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-144606444 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-144606444| 0)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-144606444 |P0Thread1of1ForFork1_#t~ite5_Out-144606444|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-144606444, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-144606444} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-144606444|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-144606444, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-144606444} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 19:42:52,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In975463608 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In975463608 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In975463608 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In975463608 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out975463608| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In975463608 |P0Thread1of1ForFork1_#t~ite6_Out975463608|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In975463608, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In975463608, ~z$w_buff1_used~0=~z$w_buff1_used~0_In975463608, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In975463608} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In975463608, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out975463608|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In975463608, ~z$w_buff1_used~0=~z$w_buff1_used~0_In975463608, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In975463608} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 19:42:52,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-871659153 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-871659153 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-871659153) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-871659153 ~z$r_buff0_thd1~0_Out-871659153)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-871659153, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-871659153} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-871659153, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-871659153|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-871659153} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:42:52,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1562020074 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1562020074 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1562020074 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1562020074 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-1562020074| ~z$r_buff1_thd1~0_In-1562020074) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1562020074|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1562020074, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1562020074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1562020074, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1562020074} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1562020074|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1562020074, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1562020074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1562020074, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1562020074} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 19:42:52,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1591139964 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1591139964 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1591139964 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1591139964 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1591139964|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1591139964 |P1Thread1of1ForFork2_#t~ite12_Out1591139964|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1591139964, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1591139964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1591139964, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1591139964} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1591139964, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1591139964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1591139964, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1591139964|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1591139964} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 19:42:52,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In101658677 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In101658677 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out101658677| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In101658677 |P1Thread1of1ForFork2_#t~ite13_Out101658677|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In101658677, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In101658677} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In101658677, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out101658677|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In101658677} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 19:42:52,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In7324794 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In7324794 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In7324794 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In7324794 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out7324794| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite14_Out7324794| ~z$r_buff1_thd2~0_In7324794) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In7324794, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In7324794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In7324794, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In7324794} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In7324794, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In7324794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In7324794, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out7324794|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In7324794} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 19:42:52,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L777-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 19:42:52,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L754-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 19:42:52,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1320621553 256)))) (or (and (= ~z$w_buff1_used~0_In1320621553 |P2Thread1of1ForFork0_#t~ite30_Out1320621553|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In1320621553| |P2Thread1of1ForFork0_#t~ite29_Out1320621553|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite30_Out1320621553| |P2Thread1of1ForFork0_#t~ite29_Out1320621553|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1320621553 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1320621553 256)) (and (= 0 (mod ~z$w_buff1_used~0_In1320621553 256)) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In1320621553 256)) .cse1))) (= ~z$w_buff1_used~0_In1320621553 |P2Thread1of1ForFork0_#t~ite29_Out1320621553|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1320621553, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1320621553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1320621553, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1320621553, ~weak$$choice2~0=~weak$$choice2~0_In1320621553, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1320621553|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1320621553, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1320621553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1320621553, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1320621553, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1320621553|, ~weak$$choice2~0=~weak$$choice2~0_In1320621553, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1320621553|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 19:42:52,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (= v_~z$r_buff0_thd3~0_51 v_~z$r_buff0_thd3~0_50) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 19:42:52,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 19:42:52,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In34610876 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In34610876 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out34610876| ~z~0_In34610876) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out34610876| ~z$w_buff1~0_In34610876)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In34610876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In34610876, ~z$w_buff1~0=~z$w_buff1~0_In34610876, ~z~0=~z~0_In34610876} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out34610876|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In34610876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In34610876, ~z$w_buff1~0=~z$w_buff1~0_In34610876, ~z~0=~z~0_In34610876} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 19:42:52,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 19:42:52,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1981881564 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1981881564 256) 0))) (or (and (= ~z$w_buff0_used~0_In1981881564 |P2Thread1of1ForFork0_#t~ite40_Out1981881564|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1981881564|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1981881564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1981881564} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1981881564, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1981881564|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1981881564} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 19:42:52,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-62675433 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-62675433 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-62675433 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-62675433 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-62675433| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite41_Out-62675433| ~z$w_buff1_used~0_In-62675433) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-62675433, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-62675433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-62675433, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-62675433} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-62675433, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-62675433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-62675433, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-62675433, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-62675433|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 19:42:52,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In899097778 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In899097778 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out899097778|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out899097778| ~z$r_buff0_thd3~0_In899097778) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In899097778, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In899097778} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In899097778, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In899097778, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out899097778|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 19:42:52,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1876587805 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1876587805 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1876587805 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1876587805 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1876587805 |P2Thread1of1ForFork0_#t~ite43_Out1876587805|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1876587805|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1876587805, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1876587805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1876587805, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1876587805} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1876587805|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1876587805, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1876587805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1876587805, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1876587805} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 19:42:52,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 19:42:52,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 19:42:52,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2136950417 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2136950417 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out2136950417| |ULTIMATE.start_main_#t~ite48_Out2136950417|))) (or (and (= ~z$w_buff1~0_In2136950417 |ULTIMATE.start_main_#t~ite47_Out2136950417|) .cse0 (not .cse1) (not .cse2)) (and (or .cse2 .cse1) .cse0 (= ~z~0_In2136950417 |ULTIMATE.start_main_#t~ite47_Out2136950417|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2136950417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2136950417, ~z$w_buff1~0=~z$w_buff1~0_In2136950417, ~z~0=~z~0_In2136950417} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2136950417, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2136950417|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2136950417, ~z$w_buff1~0=~z$w_buff1~0_In2136950417, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out2136950417|, ~z~0=~z~0_In2136950417} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 19:42:52,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1073968189 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1073968189 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1073968189|)) (and (= ~z$w_buff0_used~0_In1073968189 |ULTIMATE.start_main_#t~ite49_Out1073968189|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1073968189, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1073968189} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1073968189, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1073968189, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1073968189|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 19:42:52,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1352348890 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1352348890 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1352348890 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1352348890 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1352348890 |ULTIMATE.start_main_#t~ite50_Out-1352348890|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1352348890|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1352348890, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1352348890, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1352348890, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1352348890} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1352348890|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1352348890, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1352348890, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1352348890, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1352348890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 19:42:52,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1008022685 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1008022685 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1008022685| ~z$r_buff0_thd0~0_In-1008022685)) (and (= |ULTIMATE.start_main_#t~ite51_Out-1008022685| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1008022685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1008022685} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1008022685, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1008022685|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1008022685} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 19:42:52,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-664637122 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-664637122 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-664637122 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-664637122 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-664637122 |ULTIMATE.start_main_#t~ite52_Out-664637122|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-664637122|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-664637122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-664637122, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-664637122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-664637122} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-664637122|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-664637122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-664637122, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-664637122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-664637122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 19:42:52,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~z$r_buff1_thd0~0_16) (= 0 v_~__unbuffered_p1_EBX~0_7)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, 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 19:42:52,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:42:52 BasicIcfg [2019-12-27 19:42:52,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:42:52,357 INFO L168 Benchmark]: Toolchain (without parser) took 128304.82 ms. Allocated memory was 141.6 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 103.6 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 696.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:42:52,357 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 141.6 MB. Free memory was 123.5 MB in the beginning and 123.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 19:42:52,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.84 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 103.1 MB in the beginning and 158.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:42:52,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.10 ms. Allocated memory is still 205.0 MB. Free memory was 158.1 MB in the beginning and 155.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 19:42:52,359 INFO L168 Benchmark]: Boogie Preprocessor took 39.09 ms. Allocated memory is still 205.0 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:42:52,359 INFO L168 Benchmark]: RCFGBuilder took 862.58 ms. Allocated memory is still 205.0 MB. Free memory was 153.0 MB in the beginning and 102.1 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-27 19:42:52,360 INFO L168 Benchmark]: TraceAbstraction took 126571.59 ms. Allocated memory was 205.0 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.1 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 631.4 MB. Max. memory is 7.1 GB. [2019-12-27 19:42:52,362 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 141.6 MB. Free memory was 123.5 MB in the beginning and 123.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 764.84 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 103.1 MB in the beginning and 158.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.10 ms. Allocated memory is still 205.0 MB. Free memory was 158.1 MB in the beginning and 155.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.09 ms. Allocated memory is still 205.0 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 862.58 ms. Allocated memory is still 205.0 MB. Free memory was 153.0 MB in the beginning and 102.1 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 126571.59 ms. Allocated memory was 205.0 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.1 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 631.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7190 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85139 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L834] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L797] 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, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L797] 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) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, 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))=1, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L798] 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)) [L799] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, 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))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L799] 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)) [L800] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, 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))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 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)) [L801] 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)) [L803] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, 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=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L803] 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)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L809] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 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 [L845] 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 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 126.2s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 54.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5748 SDtfs, 7883 SDslu, 28582 SDs, 0 SdLazy, 28091 SolverSat, 629 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 575 GetRequests, 104 SyntacticMatches, 53 SemanticMatches, 418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5629 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155734occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 38.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 179348 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1020 NumberOfCodeBlocks, 1020 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 927 ConstructedInterpolants, 0 QuantifiedInterpolants, 294671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...