/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/mix034_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:58:08,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:58:08,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:58:08,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:58:08,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:58:08,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:58:08,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:58:08,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:58:08,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:58:08,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:58:08,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:58:08,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:58:08,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:58:08,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:58:08,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:58:08,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:58:08,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:58:08,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:58:08,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:58:08,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:58:08,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:58:08,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:58:08,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:58:08,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:58:08,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:58:08,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:58:08,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:58:08,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:58:08,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:58:08,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:58:08,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:58:08,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:58:08,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:58:08,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:58:08,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:58:08,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:58:08,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:58:08,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:58:08,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:58:08,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:58:08,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:58:08,772 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 20:58:08,787 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:58:08,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:58:08,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:58:08,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:58:08,788 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:58:08,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:58:08,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:58:08,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:58:08,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:58:08,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:58:08,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:58:08,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:58:08,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:58:08,790 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:58:08,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:58:08,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:58:08,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:58:08,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:58:08,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:58:08,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:58:08,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:58:08,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:58:08,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:58:08,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:58:08,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:58:08,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:58:08,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:58:08,793 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:58:08,793 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:58:08,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:58:08,794 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:58:08,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:58:09,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:58:09,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:58:09,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:58:09,083 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:58:09,083 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:58:09,084 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc.i [2019-12-27 20:58:09,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba2b7f16/92a49b36598f49fb8159377cee4f40ac/FLAGed5d841bf [2019-12-27 20:58:09,749 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:58:09,749 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc.i [2019-12-27 20:58:09,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba2b7f16/92a49b36598f49fb8159377cee4f40ac/FLAGed5d841bf [2019-12-27 20:58:09,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba2b7f16/92a49b36598f49fb8159377cee4f40ac [2019-12-27 20:58:09,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:58:09,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:58:09,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:58:09,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:58:09,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:58:09,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:58:09" (1/1) ... [2019-12-27 20:58:09,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c3b50ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:09, skipping insertion in model container [2019-12-27 20:58:09,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:58:09" (1/1) ... [2019-12-27 20:58:09,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:58:10,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:58:10,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:58:10,599 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:58:10,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:58:10,735 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:58:10,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:10 WrapperNode [2019-12-27 20:58:10,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:58:10,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:58:10,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:58:10,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:58:10,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:10" (1/1) ... [2019-12-27 20:58:10,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:10" (1/1) ... [2019-12-27 20:58:10,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:58:10,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:58:10,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:58:10,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:58:10,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:10" (1/1) ... [2019-12-27 20:58:10,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:10" (1/1) ... [2019-12-27 20:58:10,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:10" (1/1) ... [2019-12-27 20:58:10,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:10" (1/1) ... [2019-12-27 20:58:10,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:10" (1/1) ... [2019-12-27 20:58:10,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:10" (1/1) ... [2019-12-27 20:58:10,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:10" (1/1) ... [2019-12-27 20:58:10,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:58:10,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:58:10,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:58:10,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:58:10,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:10" (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 20:58:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:58:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:58:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:58:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:58:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:58:10,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:58:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:58:10,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:58:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:58:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:58:10,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:58:10,940 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 20:58:11,629 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:58:11,630 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:58:11,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:58:11 BoogieIcfgContainer [2019-12-27 20:58:11,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:58:11,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:58:11,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:58:11,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:58:11,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:58:09" (1/3) ... [2019-12-27 20:58:11,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ed2657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:58:11, skipping insertion in model container [2019-12-27 20:58:11,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:10" (2/3) ... [2019-12-27 20:58:11,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ed2657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:58:11, skipping insertion in model container [2019-12-27 20:58:11,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:58:11" (3/3) ... [2019-12-27 20:58:11,644 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc.i [2019-12-27 20:58:11,655 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:58:11,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:58:11,668 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:58:11,670 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:58:11,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,728 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,729 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,729 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,730 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,730 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:11,848 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:58:11,872 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:58:11,872 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:58:11,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:58:11,873 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:58:11,873 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:58:11,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:58:11,873 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:58:11,873 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:58:11,894 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-27 20:58:11,896 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 20:58:11,992 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 20:58:11,992 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:58:12,008 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:58:12,029 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 20:58:12,085 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 20:58:12,085 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:58:12,091 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:58:12,105 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:58:12,106 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:58:15,442 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 20:58:15,564 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 20:58:15,594 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49761 [2019-12-27 20:58:15,594 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 20:58:15,597 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 83 transitions [2019-12-27 20:58:15,977 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-27 20:58:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-27 20:58:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:58:15,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:15,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:58:15,985 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:15,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:15,990 INFO L82 PathProgramCache]: Analyzing trace with hash 798121, now seen corresponding path program 1 times [2019-12-27 20:58:16,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:16,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92188706] [2019-12-27 20:58:16,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:16,271 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 20:58:16,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92188706] [2019-12-27 20:58:16,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:16,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:58:16,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1534247478] [2019-12-27 20:58:16,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:16,283 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:16,295 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:58:16,295 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:16,299 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:16,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:16,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:16,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:16,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:16,318 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-27 20:58:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:16,553 INFO L93 Difference]: Finished difference Result 7842 states and 25482 transitions. [2019-12-27 20:58:16,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:16,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:58:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:16,646 INFO L225 Difference]: With dead ends: 7842 [2019-12-27 20:58:16,646 INFO L226 Difference]: Without dead ends: 7386 [2019-12-27 20:58:16,648 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 20:58:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7386 states. [2019-12-27 20:58:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7386 to 7386. [2019-12-27 20:58:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7386 states. [2019-12-27 20:58:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7386 states to 7386 states and 23956 transitions. [2019-12-27 20:58:17,087 INFO L78 Accepts]: Start accepts. Automaton has 7386 states and 23956 transitions. Word has length 3 [2019-12-27 20:58:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:17,087 INFO L462 AbstractCegarLoop]: Abstraction has 7386 states and 23956 transitions. [2019-12-27 20:58:17,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 7386 states and 23956 transitions. [2019-12-27 20:58:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:58:17,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:17,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:17,091 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:17,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:17,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1045751384, now seen corresponding path program 1 times [2019-12-27 20:58:17,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:17,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457464509] [2019-12-27 20:58:17,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:17,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457464509] [2019-12-27 20:58:17,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:17,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:17,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1751550422] [2019-12-27 20:58:17,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:17,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:17,144 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:58:17,144 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:17,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:17,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:17,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:17,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:17,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:17,147 INFO L87 Difference]: Start difference. First operand 7386 states and 23956 transitions. Second operand 3 states. [2019-12-27 20:58:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:17,174 INFO L93 Difference]: Finished difference Result 1203 states and 2726 transitions. [2019-12-27 20:58:17,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:17,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:58:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:17,181 INFO L225 Difference]: With dead ends: 1203 [2019-12-27 20:58:17,181 INFO L226 Difference]: Without dead ends: 1203 [2019-12-27 20:58:17,182 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 20:58:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-12-27 20:58:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2019-12-27 20:58:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-12-27 20:58:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 2726 transitions. [2019-12-27 20:58:17,212 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 2726 transitions. Word has length 11 [2019-12-27 20:58:17,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:17,213 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 2726 transitions. [2019-12-27 20:58:17,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 2726 transitions. [2019-12-27 20:58:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:58:17,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:17,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:17,215 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:17,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:17,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1102482469, now seen corresponding path program 1 times [2019-12-27 20:58:17,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:17,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930762674] [2019-12-27 20:58:17,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:17,312 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 20:58:17,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930762674] [2019-12-27 20:58:17,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:17,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:17,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [680721548] [2019-12-27 20:58:17,313 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:17,316 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:17,319 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:58:17,319 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:17,320 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:17,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:17,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:17,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:17,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:17,321 INFO L87 Difference]: Start difference. First operand 1203 states and 2726 transitions. Second operand 3 states. [2019-12-27 20:58:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:17,398 INFO L93 Difference]: Finished difference Result 1939 states and 4348 transitions. [2019-12-27 20:58:17,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:17,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 20:58:17,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:17,409 INFO L225 Difference]: With dead ends: 1939 [2019-12-27 20:58:17,410 INFO L226 Difference]: Without dead ends: 1939 [2019-12-27 20:58:17,410 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 20:58:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-27 20:58:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1336. [2019-12-27 20:58:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-12-27 20:58:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3074 transitions. [2019-12-27 20:58:17,472 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3074 transitions. Word has length 14 [2019-12-27 20:58:17,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:17,473 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 3074 transitions. [2019-12-27 20:58:17,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3074 transitions. [2019-12-27 20:58:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:58:17,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:17,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:17,479 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1024507146, now seen corresponding path program 1 times [2019-12-27 20:58:17,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:17,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105657299] [2019-12-27 20:58:17,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:17,617 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 20:58:17,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105657299] [2019-12-27 20:58:17,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:17,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:17,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [761596747] [2019-12-27 20:58:17,623 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:17,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:17,628 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:58:17,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:17,629 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:17,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:58:17,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:17,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:58:17,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:58:17,631 INFO L87 Difference]: Start difference. First operand 1336 states and 3074 transitions. Second operand 4 states. [2019-12-27 20:58:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:17,850 INFO L93 Difference]: Finished difference Result 1693 states and 3800 transitions. [2019-12-27 20:58:17,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:58:17,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:58:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:17,859 INFO L225 Difference]: With dead ends: 1693 [2019-12-27 20:58:17,860 INFO L226 Difference]: Without dead ends: 1693 [2019-12-27 20:58:17,860 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 20:58:17,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-12-27 20:58:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1629. [2019-12-27 20:58:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1629 states. [2019-12-27 20:58:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 3676 transitions. [2019-12-27 20:58:17,906 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 3676 transitions. Word has length 14 [2019-12-27 20:58:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:17,906 INFO L462 AbstractCegarLoop]: Abstraction has 1629 states and 3676 transitions. [2019-12-27 20:58:17,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:58:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 3676 transitions. [2019-12-27 20:58:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:58:17,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:17,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:17,907 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:17,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:17,908 INFO L82 PathProgramCache]: Analyzing trace with hash -399327403, now seen corresponding path program 1 times [2019-12-27 20:58:17,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:17,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227516428] [2019-12-27 20:58:17,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:17,991 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 20:58:17,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227516428] [2019-12-27 20:58:17,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:17,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:17,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [347387851] [2019-12-27 20:58:17,992 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:17,994 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:17,996 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:58:17,997 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:17,997 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:17,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:58:17,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:17,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:58:17,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:58:17,998 INFO L87 Difference]: Start difference. First operand 1629 states and 3676 transitions. Second operand 4 states. [2019-12-27 20:58:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:18,185 INFO L93 Difference]: Finished difference Result 1964 states and 4378 transitions. [2019-12-27 20:58:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:58:18,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:58:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:18,197 INFO L225 Difference]: With dead ends: 1964 [2019-12-27 20:58:18,197 INFO L226 Difference]: Without dead ends: 1964 [2019-12-27 20:58:18,198 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 20:58:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-12-27 20:58:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1704. [2019-12-27 20:58:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-27 20:58:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3842 transitions. [2019-12-27 20:58:18,290 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3842 transitions. Word has length 14 [2019-12-27 20:58:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:18,290 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3842 transitions. [2019-12-27 20:58:18,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:58:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3842 transitions. [2019-12-27 20:58:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:58:18,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:18,293 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 20:58:18,293 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash -524969657, now seen corresponding path program 1 times [2019-12-27 20:58:18,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:18,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880554670] [2019-12-27 20:58:18,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:18,376 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 20:58:18,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880554670] [2019-12-27 20:58:18,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:18,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:18,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [447796736] [2019-12-27 20:58:18,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:18,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:18,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:58:18,391 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:18,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:18,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:18,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:18,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:18,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:18,393 INFO L87 Difference]: Start difference. First operand 1704 states and 3842 transitions. Second operand 5 states. [2019-12-27 20:58:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:18,644 INFO L93 Difference]: Finished difference Result 2231 states and 4892 transitions. [2019-12-27 20:58:18,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:58:18,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:58:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:18,662 INFO L225 Difference]: With dead ends: 2231 [2019-12-27 20:58:18,662 INFO L226 Difference]: Without dead ends: 2231 [2019-12-27 20:58:18,663 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 20:58:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-12-27 20:58:18,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1975. [2019-12-27 20:58:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2019-12-27 20:58:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 4398 transitions. [2019-12-27 20:58:18,711 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 4398 transitions. Word has length 25 [2019-12-27 20:58:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:18,711 INFO L462 AbstractCegarLoop]: Abstraction has 1975 states and 4398 transitions. [2019-12-27 20:58:18,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 4398 transitions. [2019-12-27 20:58:18,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:58:18,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:18,714 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] [2019-12-27 20:58:18,715 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:18,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:18,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1656128157, now seen corresponding path program 1 times [2019-12-27 20:58:18,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:18,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978439207] [2019-12-27 20:58:18,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:18,762 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 20:58:18,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978439207] [2019-12-27 20:58:18,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:18,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:18,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [798463017] [2019-12-27 20:58:18,763 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:18,767 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:18,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:58:18,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:18,814 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:58:18,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:18,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:18,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:18,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:18,815 INFO L87 Difference]: Start difference. First operand 1975 states and 4398 transitions. Second operand 5 states. [2019-12-27 20:58:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:18,848 INFO L93 Difference]: Finished difference Result 1031 states and 2198 transitions. [2019-12-27 20:58:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:58:18,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:58:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:18,853 INFO L225 Difference]: With dead ends: 1031 [2019-12-27 20:58:18,853 INFO L226 Difference]: Without dead ends: 1031 [2019-12-27 20:58:18,853 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 20:58:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-12-27 20:58:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 973. [2019-12-27 20:58:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-12-27 20:58:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 2091 transitions. [2019-12-27 20:58:18,879 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 2091 transitions. Word has length 26 [2019-12-27 20:58:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:18,879 INFO L462 AbstractCegarLoop]: Abstraction has 973 states and 2091 transitions. [2019-12-27 20:58:18,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 2091 transitions. [2019-12-27 20:58:18,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:58:18,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:18,881 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] [2019-12-27 20:58:18,882 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:18,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:18,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2023210146, now seen corresponding path program 1 times [2019-12-27 20:58:18,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:18,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18278105] [2019-12-27 20:58:18,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:18,991 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 20:58:18,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18278105] [2019-12-27 20:58:18,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:18,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:18,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1265670223] [2019-12-27 20:58:18,993 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:19,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:19,017 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 20:58:19,017 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:19,018 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:19,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:19,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:19,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:19,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:19,019 INFO L87 Difference]: Start difference. First operand 973 states and 2091 transitions. Second operand 5 states. [2019-12-27 20:58:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:19,241 INFO L93 Difference]: Finished difference Result 1107 states and 2333 transitions. [2019-12-27 20:58:19,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:58:19,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:58:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:19,251 INFO L225 Difference]: With dead ends: 1107 [2019-12-27 20:58:19,251 INFO L226 Difference]: Without dead ends: 1107 [2019-12-27 20:58:19,252 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 20:58:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-12-27 20:58:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 869. [2019-12-27 20:58:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-12-27 20:58:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1878 transitions. [2019-12-27 20:58:19,283 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1878 transitions. Word has length 26 [2019-12-27 20:58:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:19,283 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1878 transitions. [2019-12-27 20:58:19,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1878 transitions. [2019-12-27 20:58:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:58:19,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:19,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:19,288 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:19,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:19,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1815455026, now seen corresponding path program 1 times [2019-12-27 20:58:19,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:19,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972113463] [2019-12-27 20:58:19,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:19,441 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 20:58:19,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972113463] [2019-12-27 20:58:19,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:19,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:58:19,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1593594422] [2019-12-27 20:58:19,442 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:19,458 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:19,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 131 transitions. [2019-12-27 20:58:19,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:19,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:58:19,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:58:19,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:19,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:58:19,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:58:19,628 INFO L87 Difference]: Start difference. First operand 869 states and 1878 transitions. Second operand 10 states. [2019-12-27 20:58:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:20,056 INFO L93 Difference]: Finished difference Result 2533 states and 5378 transitions. [2019-12-27 20:58:20,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:58:20,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-27 20:58:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:20,063 INFO L225 Difference]: With dead ends: 2533 [2019-12-27 20:58:20,063 INFO L226 Difference]: Without dead ends: 1738 [2019-12-27 20:58:20,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:58:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-12-27 20:58:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 983. [2019-12-27 20:58:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2019-12-27 20:58:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 2118 transitions. [2019-12-27 20:58:20,096 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 2118 transitions. Word has length 51 [2019-12-27 20:58:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:20,097 INFO L462 AbstractCegarLoop]: Abstraction has 983 states and 2118 transitions. [2019-12-27 20:58:20,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:58:20,097 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 2118 transitions. [2019-12-27 20:58:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:58:20,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:20,100 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] [2019-12-27 20:58:20,100 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:20,100 INFO L82 PathProgramCache]: Analyzing trace with hash 700498790, now seen corresponding path program 2 times [2019-12-27 20:58:20,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:20,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425050473] [2019-12-27 20:58:20,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:20,179 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 20:58:20,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425050473] [2019-12-27 20:58:20,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:20,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:20,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1302755671] [2019-12-27 20:58:20,180 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:20,197 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:20,320 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 103 states and 142 transitions. [2019-12-27 20:58:20,320 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:20,334 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:58:20,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:20,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:20,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:20,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:20,336 INFO L87 Difference]: Start difference. First operand 983 states and 2118 transitions. Second operand 3 states. [2019-12-27 20:58:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:20,383 INFO L93 Difference]: Finished difference Result 1302 states and 2767 transitions. [2019-12-27 20:58:20,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:20,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:58:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:20,387 INFO L225 Difference]: With dead ends: 1302 [2019-12-27 20:58:20,387 INFO L226 Difference]: Without dead ends: 1302 [2019-12-27 20:58:20,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 5 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 20:58:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-27 20:58:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1086. [2019-12-27 20:58:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-12-27 20:58:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 2341 transitions. [2019-12-27 20:58:20,418 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 2341 transitions. Word has length 51 [2019-12-27 20:58:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:20,418 INFO L462 AbstractCegarLoop]: Abstraction has 1086 states and 2341 transitions. [2019-12-27 20:58:20,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 2341 transitions. [2019-12-27 20:58:20,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:58:20,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:20,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:20,425 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:20,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:20,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1020694631, now seen corresponding path program 1 times [2019-12-27 20:58:20,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:20,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053996718] [2019-12-27 20:58:20,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:20,540 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 20:58:20,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053996718] [2019-12-27 20:58:20,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:20,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:20,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [532824418] [2019-12-27 20:58:20,541 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:20,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:20,633 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 146 transitions. [2019-12-27 20:58:20,633 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:20,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:58:20,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:58:20,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:20,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:58:20,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:58:20,641 INFO L87 Difference]: Start difference. First operand 1086 states and 2341 transitions. Second operand 4 states. [2019-12-27 20:58:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:20,718 INFO L93 Difference]: Finished difference Result 1086 states and 2329 transitions. [2019-12-27 20:58:20,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:58:20,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 20:58:20,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:20,722 INFO L225 Difference]: With dead ends: 1086 [2019-12-27 20:58:20,722 INFO L226 Difference]: Without dead ends: 1086 [2019-12-27 20:58:20,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 5 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 20:58:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-12-27 20:58:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 983. [2019-12-27 20:58:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2019-12-27 20:58:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 2106 transitions. [2019-12-27 20:58:20,745 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 2106 transitions. Word has length 52 [2019-12-27 20:58:20,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:20,746 INFO L462 AbstractCegarLoop]: Abstraction has 983 states and 2106 transitions. [2019-12-27 20:58:20,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:58:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 2106 transitions. [2019-12-27 20:58:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:58:20,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:20,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:20,811 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:20,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:20,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1332632369, now seen corresponding path program 1 times [2019-12-27 20:58:20,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:20,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858324548] [2019-12-27 20:58:20,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:20,954 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 20:58:20,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858324548] [2019-12-27 20:58:20,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:20,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:20,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1068954520] [2019-12-27 20:58:20,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:20,972 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:21,013 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 100 transitions. [2019-12-27 20:58:21,013 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:21,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:21,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:21,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:21,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:21,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:21,014 INFO L87 Difference]: Start difference. First operand 983 states and 2106 transitions. Second operand 3 states. [2019-12-27 20:58:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:21,035 INFO L93 Difference]: Finished difference Result 982 states and 2104 transitions. [2019-12-27 20:58:21,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:21,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:58:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:21,038 INFO L225 Difference]: With dead ends: 982 [2019-12-27 20:58:21,038 INFO L226 Difference]: Without dead ends: 982 [2019-12-27 20:58:21,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-12-27 20:58:21,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 836. [2019-12-27 20:58:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-12-27 20:58:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1828 transitions. [2019-12-27 20:58:21,058 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1828 transitions. Word has length 52 [2019-12-27 20:58:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:21,058 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1828 transitions. [2019-12-27 20:58:21,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1828 transitions. [2019-12-27 20:58:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:58:21,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:21,061 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] [2019-12-27 20:58:21,061 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:21,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:21,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1167104957, now seen corresponding path program 1 times [2019-12-27 20:58:21,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:21,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630745654] [2019-12-27 20:58:21,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:58:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:58:21,174 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:58:21,174 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:58:21,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_50| 0 0))) (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t897~0.base_27| 4)) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= v_~z$w_buff0_used~0_109 0) (= v_~main$tmp_guard0~0_7 0) (= v_~z~0_24 0) (= 0 v_~z$r_buff1_thd0~0_21) (= v_~z$r_buff0_thd2~0_79 0) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~y~0_7) (= 0 v_~z$r_buff1_thd1~0_18) (= 0 v_~x~0_7) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_24 0) (= 0 v_~z$mem_tmp~0_9) (= |v_#valid_48| (store .cse0 |v_ULTIMATE.start_main_~#t897~0.base_27| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t897~0.base_27|) 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t897~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t897~0.base_27|) |v_ULTIMATE.start_main_~#t897~0.offset_20| 0)) |v_#memory_int_15|) (= v_~z$r_buff0_thd0~0_18 0) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$w_buff1_used~0_69) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard1~0_13 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t897~0.base_27|) (= |v_ULTIMATE.start_main_~#t897~0.offset_20| 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd2~0_50) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t898~0.offset=|v_ULTIMATE.start_main_~#t898~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_50, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t898~0.base=|v_ULTIMATE.start_main_~#t898~0.base_19|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ULTIMATE.start_main_~#t897~0.offset=|v_ULTIMATE.start_main_~#t897~0.offset_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_21, #length=|v_#length_15|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_79, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_109, ~z$w_buff0~0=v_~z$w_buff0~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_48|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t897~0.base=|v_ULTIMATE.start_main_~#t897~0.base_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t898~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t898~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t897~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ULTIMATE.start_main_~#t897~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 20:58:21,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t898~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t898~0.base_13|) |v_ULTIMATE.start_main_~#t898~0.offset_11| 1))) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t898~0.base_13| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t898~0.base_13|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t898~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t898~0.base_13|) (= |v_ULTIMATE.start_main_~#t898~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t898~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t898~0.base=|v_ULTIMATE.start_main_~#t898~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t898~0.offset=|v_ULTIMATE.start_main_~#t898~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t898~0.base, ULTIMATE.start_main_~#t898~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:58:21,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1~0_Out1027180336 ~z$w_buff0~0_In1027180336) (= |P0Thread1of1ForFork0_#in~arg.offset_In1027180336| P0Thread1of1ForFork0_~arg.offset_Out1027180336) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1027180336| 1) (= ~z$w_buff0_used~0_In1027180336 ~z$w_buff1_used~0_Out1027180336) (= ~z$w_buff0~0_Out1027180336 1) (= 0 (mod ~z$w_buff1_used~0_Out1027180336 256)) (= P0Thread1of1ForFork0_~arg.base_Out1027180336 |P0Thread1of1ForFork0_#in~arg.base_In1027180336|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1027180336| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1027180336) (= ~z$w_buff0_used~0_Out1027180336 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1027180336|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1027180336, ~z$w_buff0~0=~z$w_buff0~0_In1027180336, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1027180336|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1027180336|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1027180336, ~z$w_buff0~0=~z$w_buff0~0_Out1027180336, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1027180336, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1027180336, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1027180336|, ~z$w_buff1~0=~z$w_buff1~0_Out1027180336, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1027180336, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1027180336|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1027180336} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 20:58:21,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L773-->L773-8: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In978759802 256) 0)) (.cse4 (= |P1Thread1of1ForFork1_#t~ite24_Out978759802| |P1Thread1of1ForFork1_#t~ite23_Out978759802|)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In978759802 256))) (.cse5 (= (mod ~weak$$choice2~0_In978759802 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In978759802 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In978759802 256) 0))) (or (and (or (and (or .cse0 (and .cse1 .cse2) (and .cse1 .cse3)) (= |P1Thread1of1ForFork1_#t~ite23_Out978759802| ~z$w_buff1_used~0_In978759802) .cse4 .cse5) (and (= |P1Thread1of1ForFork1_#t~ite23_Out978759802| |P1Thread1of1ForFork1_#t~ite23_In978759802|) (= |P1Thread1of1ForFork1_#t~ite24_Out978759802| ~z$w_buff1_used~0_In978759802) (not .cse5))) (= |P1Thread1of1ForFork1_#t~ite22_In978759802| |P1Thread1of1ForFork1_#t~ite22_Out978759802|)) (let ((.cse6 (not .cse1))) (and (or .cse6 (not .cse3)) (= |P1Thread1of1ForFork1_#t~ite23_Out978759802| |P1Thread1of1ForFork1_#t~ite22_Out978759802|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out978759802|) .cse4 (not .cse0) .cse5 (or .cse6 (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In978759802, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In978759802, ~z$w_buff1_used~0=~z$w_buff1_used~0_In978759802, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In978759802|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In978759802|, ~weak$$choice2~0=~weak$$choice2~0_In978759802, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In978759802} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In978759802, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In978759802, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out978759802|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In978759802, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out978759802|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out978759802|, ~weak$$choice2~0=~weak$$choice2~0_In978759802, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In978759802} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 20:58:21,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L774-->L775: Formula: (and (= v_~z$r_buff0_thd2~0_64 v_~z$r_buff0_thd2~0_63) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_64} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_63, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:58:21,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L775-->L775-8: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-886684834 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out-886684834| |P1Thread1of1ForFork1_#t~ite29_Out-886684834|)) (.cse4 (= (mod ~z$r_buff1_thd2~0_In-886684834 256) 0)) (.cse5 (= 0 (mod ~weak$$choice2~0_In-886684834 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-886684834 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-886684834 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In-886684834| |P1Thread1of1ForFork1_#t~ite28_Out-886684834|) (or (and .cse0 (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4)) (= ~z$r_buff1_thd2~0_In-886684834 |P1Thread1of1ForFork1_#t~ite29_Out-886684834|) .cse5) (and (= |P1Thread1of1ForFork1_#t~ite29_In-886684834| |P1Thread1of1ForFork1_#t~ite29_Out-886684834|) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite30_Out-886684834| ~z$r_buff1_thd2~0_In-886684834)))) (let ((.cse6 (not .cse2))) (and (or (not .cse3) .cse6) .cse0 (or (not .cse4) .cse6) (= |P1Thread1of1ForFork1_#t~ite28_Out-886684834| |P1Thread1of1ForFork1_#t~ite29_Out-886684834|) .cse5 (= |P1Thread1of1ForFork1_#t~ite28_Out-886684834| 0) (not .cse1))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-886684834|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-886684834, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-886684834, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-886684834, ~weak$$choice2~0=~weak$$choice2~0_In-886684834, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-886684834, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-886684834|} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-886684834|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-886684834|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-886684834, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-886684834, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-886684834, ~weak$$choice2~0=~weak$$choice2~0_In-886684834, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-886684834, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-886684834|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:58:21,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_17 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 20:58:21,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2046248378 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In2046248378 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out2046248378| ~z$w_buff0_used~0_In2046248378) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2046248378| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2046248378, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2046248378} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2046248378|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2046248378, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2046248378} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:58:21,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-223671999 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-223671999 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-223671999 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-223671999 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-223671999|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-223671999 |P0Thread1of1ForFork0_#t~ite6_Out-223671999|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-223671999, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-223671999, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-223671999, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-223671999} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-223671999|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-223671999, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-223671999, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-223671999, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-223671999} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:58:21,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In2067737215 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2067737215 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out2067737215)) (and (= ~z$r_buff0_thd1~0_In2067737215 ~z$r_buff0_thd1~0_Out2067737215) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2067737215, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2067737215} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2067737215, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2067737215|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2067737215} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:58:21,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1977936548 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1977936548 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1977936548 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1977936548 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1977936548| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out1977936548| ~z$r_buff1_thd1~0_In1977936548)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1977936548, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1977936548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1977936548, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1977936548} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1977936548, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1977936548|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1977936548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1977936548, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1977936548} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:58:21,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In1021671357 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1021671357 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out1021671357| |P1Thread1of1ForFork1_#t~ite32_Out1021671357|))) (or (and (= ~z$w_buff1~0_In1021671357 |P1Thread1of1ForFork1_#t~ite32_Out1021671357|) (not .cse0) (not .cse1) .cse2) (and (= ~z~0_In1021671357 |P1Thread1of1ForFork1_#t~ite32_Out1021671357|) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1021671357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1021671357, ~z$w_buff1~0=~z$w_buff1~0_In1021671357, ~z~0=~z~0_In1021671357} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1021671357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1021671357, ~z$w_buff1~0=~z$w_buff1~0_In1021671357, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1021671357|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1021671357|, ~z~0=~z~0_In1021671357} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 20:58:21,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-408570544 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-408570544 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-408570544| ~z$w_buff0_used~0_In-408570544)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-408570544|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-408570544, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-408570544} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-408570544, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-408570544|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-408570544} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:58:21,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In447991041 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In447991041 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In447991041 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In447991041 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out447991041| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out447991041| ~z$w_buff1_used~0_In447991041) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In447991041, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In447991041, ~z$w_buff1_used~0=~z$w_buff1_used~0_In447991041, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In447991041} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In447991041, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In447991041, ~z$w_buff1_used~0=~z$w_buff1_used~0_In447991041, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out447991041|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In447991041} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:58:21,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In342569002 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In342569002 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out342569002|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In342569002 |P1Thread1of1ForFork1_#t~ite36_Out342569002|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In342569002, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In342569002} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In342569002, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In342569002, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out342569002|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:58:21,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1088544696 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1088544696 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1088544696 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1088544696 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1088544696| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out1088544696| ~z$r_buff1_thd2~0_In1088544696) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1088544696, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1088544696, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1088544696, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1088544696} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1088544696, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1088544696, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1088544696, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1088544696, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1088544696|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:58:21,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_40 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:58:21,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:58:21,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:58:21,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-368321910 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-368321910 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-368321910| ~z$w_buff1~0_In-368321910) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-368321910| ~z~0_In-368321910)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-368321910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-368321910, ~z$w_buff1~0=~z$w_buff1~0_In-368321910, ~z~0=~z~0_In-368321910} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-368321910|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-368321910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-368321910, ~z$w_buff1~0=~z$w_buff1~0_In-368321910, ~z~0=~z~0_In-368321910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:58:21,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_15 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~z~0=v_~z~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-27 20:58:21,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-740949860 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-740949860 256) 0))) (or (and (= ~z$w_buff0_used~0_In-740949860 |ULTIMATE.start_main_#t~ite42_Out-740949860|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-740949860|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-740949860, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-740949860} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-740949860, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-740949860, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-740949860|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:58:21,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1974147651 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1974147651 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1974147651 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1974147651 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1974147651| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out1974147651| ~z$w_buff1_used~0_In1974147651) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1974147651, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1974147651, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1974147651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1974147651} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1974147651, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1974147651, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1974147651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1974147651, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1974147651|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:58:21,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1238823782 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1238823782 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1238823782 |ULTIMATE.start_main_#t~ite44_Out-1238823782|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1238823782|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1238823782, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1238823782} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1238823782, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1238823782, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1238823782|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:58:21,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In165910067 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In165910067 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In165910067 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In165910067 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out165910067| ~z$r_buff1_thd0~0_In165910067) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out165910067| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In165910067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In165910067, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In165910067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In165910067} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In165910067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In165910067, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In165910067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In165910067, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out165910067|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:58:21,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EAX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~z$r_buff1_thd0~0_14) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:58:21,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:58:21 BasicIcfg [2019-12-27 20:58:21,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:58:21,295 INFO L168 Benchmark]: Toolchain (without parser) took 11327.76 ms. Allocated memory was 145.8 MB in the beginning and 438.8 MB in the end (delta: 293.1 MB). Free memory was 101.4 MB in the beginning and 189.2 MB in the end (delta: -87.9 MB). Peak memory consumption was 205.2 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:21,296 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 20:58:21,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.65 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 156.4 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:21,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.66 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:21,301 INFO L168 Benchmark]: Boogie Preprocessor took 52.96 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:21,302 INFO L168 Benchmark]: RCFGBuilder took 767.50 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 107.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:21,303 INFO L168 Benchmark]: TraceAbstraction took 9660.34 ms. Allocated memory was 202.9 MB in the beginning and 438.8 MB in the end (delta: 235.9 MB). Free memory was 106.3 MB in the beginning and 189.2 MB in the end (delta: -82.9 MB). Peak memory consumption was 153.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:21,314 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.27 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.65 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 156.4 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.66 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.96 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 767.50 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 107.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9660.34 ms. Allocated memory was 202.9 MB in the beginning and 438.8 MB in the end (delta: 235.9 MB). Free memory was 106.3 MB in the beginning and 189.2 MB in the end (delta: -82.9 MB). Peak memory consumption was 153.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 149 ProgramPointsBefore, 74 ProgramPointsAfterwards, 183 TransitionsBefore, 83 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 4346 VarBasedMoverChecksPositive, 182 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49761 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 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, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 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) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 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 [L781] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 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) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 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 [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 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 [L815] 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 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.3s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1347 SDtfs, 890 SDslu, 3006 SDs, 0 SdLazy, 1086 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 13 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8010occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 2699 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 57359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...