/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:53:58,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:53:58,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:53:58,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:53:58,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:53:58,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:53:58,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:53:58,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:53:58,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:53:58,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:53:58,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:53:58,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:53:58,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:53:58,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:53:58,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:53:58,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:53:58,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:53:58,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:53:58,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:53:58,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:53:58,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:53:58,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:53:58,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:53:58,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:53:58,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:53:58,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:53:58,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:53:58,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:53:58,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:53:58,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:53:58,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:53:58,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:53:58,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:53:58,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:53:58,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:53:58,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:53:58,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:53:58,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:53:58,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:53:58,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:53:58,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:53:58,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:53:58,755 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:53:58,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:53:58,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:53:58,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:53:58,760 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:53:58,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:53:58,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:53:58,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:53:58,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:53:58,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:53:58,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:53:58,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:53:58,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:53:58,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:53:58,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:53:58,762 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:53:58,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:53:58,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:53:58,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:53:58,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:53:58,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:53:58,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:53:58,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:53:58,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:53:58,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:53:58,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:53:58,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:53:58,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:53:58,766 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:53:58,766 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:53:59,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:53:59,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:53:59,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:53:59,097 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:53:59,097 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:53:59,098 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i [2019-12-26 21:53:59,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9213e48/372ff32043d44ff69fd992977ddceb71/FLAGe337823db [2019-12-26 21:53:59,699 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:53:59,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i [2019-12-26 21:53:59,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9213e48/372ff32043d44ff69fd992977ddceb71/FLAGe337823db [2019-12-26 21:54:00,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9213e48/372ff32043d44ff69fd992977ddceb71 [2019-12-26 21:54:00,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:54:00,060 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:54:00,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:54:00,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:54:00,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:54:00,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:54:00" (1/1) ... [2019-12-26 21:54:00,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00, skipping insertion in model container [2019-12-26 21:54:00,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:54:00" (1/1) ... [2019-12-26 21:54:00,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:54:00,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:54:00,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:54:00,683 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:54:00,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:54:00,845 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:54:00,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00 WrapperNode [2019-12-26 21:54:00,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:54:00,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:54:00,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:54:00,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:54:00,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00" (1/1) ... [2019-12-26 21:54:00,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00" (1/1) ... [2019-12-26 21:54:00,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:54:00,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:54:00,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:54:00,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:54:00,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00" (1/1) ... [2019-12-26 21:54:00,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00" (1/1) ... [2019-12-26 21:54:00,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00" (1/1) ... [2019-12-26 21:54:00,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00" (1/1) ... [2019-12-26 21:54:00,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00" (1/1) ... [2019-12-26 21:54:00,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00" (1/1) ... [2019-12-26 21:54:00,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00" (1/1) ... [2019-12-26 21:54:00,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:54:00,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:54:00,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:54:00,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:54:00,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00" (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-26 21:54:01,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:54:01,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:54:01,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:54:01,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:54:01,007 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:54:01,008 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:54:01,008 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:54:01,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:54:01,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:54:01,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:54:01,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:54:01,011 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:54:01,745 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:54:01,746 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:54:01,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:54:01 BoogieIcfgContainer [2019-12-26 21:54:01,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:54:01,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:54:01,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:54:01,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:54:01,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:54:00" (1/3) ... [2019-12-26 21:54:01,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241381af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:54:01, skipping insertion in model container [2019-12-26 21:54:01,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:00" (2/3) ... [2019-12-26 21:54:01,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241381af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:54:01, skipping insertion in model container [2019-12-26 21:54:01,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:54:01" (3/3) ... [2019-12-26 21:54:01,756 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.oepc.i [2019-12-26 21:54:01,768 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:54:01,768 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:54:01,776 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:54:01,778 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:54:01,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,819 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,819 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,829 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,830 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,863 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,863 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,863 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,881 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:01,921 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 21:54:01,943 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:54:01,943 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:54:01,943 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:54:01,943 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:54:01,944 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:54:01,944 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:54:01,944 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:54:01,944 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:54:01,964 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-26 21:54:01,966 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 21:54:02,065 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 21:54:02,065 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:54:02,079 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 21:54:02,097 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 21:54:02,182 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 21:54:02,182 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:54:02,191 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 21:54:02,204 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 21:54:02,205 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:54:07,234 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 21:54:07,341 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-26 21:54:07,389 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-26 21:54:07,389 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-26 21:54:07,393 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-26 21:54:07,810 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-26 21:54:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-26 21:54:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:54:07,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:07,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:54:07,821 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:07,828 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-26 21:54:07,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:07,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392311727] [2019-12-26 21:54:07,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:08,061 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-26 21:54:08,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392311727] [2019-12-26 21:54:08,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:08,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:54:08,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561977641] [2019-12-26 21:54:08,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:08,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:08,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:08,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:08,094 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-26 21:54:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:08,369 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-26 21:54:08,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:08,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:54:08,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:08,453 INFO L225 Difference]: With dead ends: 8468 [2019-12-26 21:54:08,453 INFO L226 Difference]: Without dead ends: 7976 [2019-12-26 21:54:08,455 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-26 21:54:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-26 21:54:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-26 21:54:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-26 21:54:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-26 21:54:09,074 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-26 21:54:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:09,074 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-26 21:54:09,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-26 21:54:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:54:09,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:09,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:09,079 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:09,080 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-26 21:54:09,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:09,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961292098] [2019-12-26 21:54:09,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:09,229 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-26 21:54:09,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961292098] [2019-12-26 21:54:09,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:09,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:54:09,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097687201] [2019-12-26 21:54:09,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:54:09,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:09,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:54:09,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:54:09,232 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-26 21:54:09,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:09,304 INFO L93 Difference]: Finished difference Result 1834 states and 4623 transitions. [2019-12-26 21:54:09,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:54:09,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:54:09,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:09,312 INFO L225 Difference]: With dead ends: 1834 [2019-12-26 21:54:09,312 INFO L226 Difference]: Without dead ends: 1342 [2019-12-26 21:54:09,313 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-26 21:54:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-12-26 21:54:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2019-12-26 21:54:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-12-26 21:54:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3045 transitions. [2019-12-26 21:54:09,355 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3045 transitions. Word has length 11 [2019-12-26 21:54:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:09,356 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 3045 transitions. [2019-12-26 21:54:09,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:54:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3045 transitions. [2019-12-26 21:54:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:54:09,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:09,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:09,359 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:09,359 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-26 21:54:09,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:09,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161165] [2019-12-26 21:54:09,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:09,458 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-26 21:54:09,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161165] [2019-12-26 21:54:09,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:09,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:54:09,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936923334] [2019-12-26 21:54:09,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:54:09,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:09,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:54:09,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:54:09,460 INFO L87 Difference]: Start difference. First operand 1342 states and 3045 transitions. Second operand 4 states. [2019-12-26 21:54:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:09,705 INFO L93 Difference]: Finished difference Result 1673 states and 3729 transitions. [2019-12-26 21:54:09,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:54:09,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 21:54:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:09,715 INFO L225 Difference]: With dead ends: 1673 [2019-12-26 21:54:09,715 INFO L226 Difference]: Without dead ends: 1673 [2019-12-26 21:54:09,715 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-26 21:54:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-12-26 21:54:09,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1609. [2019-12-26 21:54:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-12-26 21:54:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3605 transitions. [2019-12-26 21:54:09,768 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3605 transitions. Word has length 14 [2019-12-26 21:54:09,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:09,771 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3605 transitions. [2019-12-26 21:54:09,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:54:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3605 transitions. [2019-12-26 21:54:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:54:09,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:09,777 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-26 21:54:09,777 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:09,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:09,778 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-26 21:54:09,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:09,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269693121] [2019-12-26 21:54:09,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:09,953 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-26 21:54:09,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269693121] [2019-12-26 21:54:09,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:09,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:54:09,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506194696] [2019-12-26 21:54:09,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:54:09,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:09,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:54:09,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:54:09,956 INFO L87 Difference]: Start difference. First operand 1609 states and 3605 transitions. Second operand 6 states. [2019-12-26 21:54:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:10,657 INFO L93 Difference]: Finished difference Result 4481 states and 9905 transitions. [2019-12-26 21:54:10,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:54:10,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 21:54:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:10,683 INFO L225 Difference]: With dead ends: 4481 [2019-12-26 21:54:10,684 INFO L226 Difference]: Without dead ends: 4446 [2019-12-26 21:54:10,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:54:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-12-26 21:54:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2169. [2019-12-26 21:54:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-12-26 21:54:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 4909 transitions. [2019-12-26 21:54:10,766 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 4909 transitions. Word has length 25 [2019-12-26 21:54:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:10,767 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 4909 transitions. [2019-12-26 21:54:10,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:54:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 4909 transitions. [2019-12-26 21:54:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 21:54:10,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:10,771 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-26 21:54:10,771 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:10,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:10,772 INFO L82 PathProgramCache]: Analyzing trace with hash -662536504, now seen corresponding path program 1 times [2019-12-26 21:54:10,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:10,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778354993] [2019-12-26 21:54:10,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:10,878 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-26 21:54:10,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778354993] [2019-12-26 21:54:10,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:10,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:54:10,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469766276] [2019-12-26 21:54:10,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:10,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:10,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:10,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:10,881 INFO L87 Difference]: Start difference. First operand 2169 states and 4909 transitions. Second operand 3 states. [2019-12-26 21:54:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:10,967 INFO L93 Difference]: Finished difference Result 2168 states and 4907 transitions. [2019-12-26 21:54:10,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:10,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-26 21:54:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:10,979 INFO L225 Difference]: With dead ends: 2168 [2019-12-26 21:54:10,980 INFO L226 Difference]: Without dead ends: 2168 [2019-12-26 21:54:10,980 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-26 21:54:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2019-12-26 21:54:11,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2019-12-26 21:54:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2019-12-26 21:54:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 4907 transitions. [2019-12-26 21:54:11,029 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 4907 transitions. Word has length 26 [2019-12-26 21:54:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:11,029 INFO L462 AbstractCegarLoop]: Abstraction has 2168 states and 4907 transitions. [2019-12-26 21:54:11,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 4907 transitions. [2019-12-26 21:54:11,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 21:54:11,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:11,033 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-26 21:54:11,033 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:11,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:11,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-26 21:54:11,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:11,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865009075] [2019-12-26 21:54:11,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:11,155 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-26 21:54:11,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865009075] [2019-12-26 21:54:11,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:11,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:54:11,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143978594] [2019-12-26 21:54:11,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:54:11,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:11,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:54:11,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:54:11,157 INFO L87 Difference]: Start difference. First operand 2168 states and 4907 transitions. Second operand 6 states. [2019-12-26 21:54:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:11,251 INFO L93 Difference]: Finished difference Result 3175 states and 6989 transitions. [2019-12-26 21:54:11,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:54:11,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-26 21:54:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:11,260 INFO L225 Difference]: With dead ends: 3175 [2019-12-26 21:54:11,260 INFO L226 Difference]: Without dead ends: 3175 [2019-12-26 21:54:11,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:54:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2019-12-26 21:54:11,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2232. [2019-12-26 21:54:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2019-12-26 21:54:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 4979 transitions. [2019-12-26 21:54:11,322 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 4979 transitions. Word has length 26 [2019-12-26 21:54:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:11,322 INFO L462 AbstractCegarLoop]: Abstraction has 2232 states and 4979 transitions. [2019-12-26 21:54:11,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:54:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 4979 transitions. [2019-12-26 21:54:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:54:11,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:11,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:11,326 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:11,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1022467216, now seen corresponding path program 1 times [2019-12-26 21:54:11,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:11,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391096292] [2019-12-26 21:54:11,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:11,370 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-26 21:54:11,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391096292] [2019-12-26 21:54:11,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:11,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:54:11,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566113231] [2019-12-26 21:54:11,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:11,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:11,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:11,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:11,373 INFO L87 Difference]: Start difference. First operand 2232 states and 4979 transitions. Second operand 3 states. [2019-12-26 21:54:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:11,400 INFO L93 Difference]: Finished difference Result 3498 states and 7914 transitions. [2019-12-26 21:54:11,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:11,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 21:54:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:11,405 INFO L225 Difference]: With dead ends: 3498 [2019-12-26 21:54:11,405 INFO L226 Difference]: Without dead ends: 1625 [2019-12-26 21:54:11,406 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-26 21:54:11,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2019-12-26 21:54:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1605. [2019-12-26 21:54:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-12-26 21:54:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 3571 transitions. [2019-12-26 21:54:11,456 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 3571 transitions. Word has length 27 [2019-12-26 21:54:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:11,456 INFO L462 AbstractCegarLoop]: Abstraction has 1605 states and 3571 transitions. [2019-12-26 21:54:11,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 3571 transitions. [2019-12-26 21:54:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:54:11,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:11,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:11,460 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:11,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:11,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1564138658, now seen corresponding path program 2 times [2019-12-26 21:54:11,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:11,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352685869] [2019-12-26 21:54:11,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:11,559 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-26 21:54:11,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352685869] [2019-12-26 21:54:11,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:11,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:54:11,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143390547] [2019-12-26 21:54:11,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:54:11,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:11,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:54:11,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:54:11,561 INFO L87 Difference]: Start difference. First operand 1605 states and 3571 transitions. Second operand 5 states. [2019-12-26 21:54:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:12,059 INFO L93 Difference]: Finished difference Result 2492 states and 5414 transitions. [2019-12-26 21:54:12,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:54:12,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 21:54:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:12,075 INFO L225 Difference]: With dead ends: 2492 [2019-12-26 21:54:12,076 INFO L226 Difference]: Without dead ends: 2492 [2019-12-26 21:54:12,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:54:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2019-12-26 21:54:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2281. [2019-12-26 21:54:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-12-26 21:54:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 5003 transitions. [2019-12-26 21:54:12,136 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 5003 transitions. Word has length 27 [2019-12-26 21:54:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:12,136 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 5003 transitions. [2019-12-26 21:54:12,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:54:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 5003 transitions. [2019-12-26 21:54:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:54:12,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:12,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:12,146 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:12,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:12,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1981838884, now seen corresponding path program 1 times [2019-12-26 21:54:12,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:12,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308781836] [2019-12-26 21:54:12,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:12,286 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-26 21:54:12,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308781836] [2019-12-26 21:54:12,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:12,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:54:12,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676533786] [2019-12-26 21:54:12,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:54:12,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:12,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:54:12,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:54:12,289 INFO L87 Difference]: Start difference. First operand 2281 states and 5003 transitions. Second operand 6 states. [2019-12-26 21:54:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:12,828 INFO L93 Difference]: Finished difference Result 4123 states and 8675 transitions. [2019-12-26 21:54:12,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:54:12,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 21:54:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:12,840 INFO L225 Difference]: With dead ends: 4123 [2019-12-26 21:54:12,841 INFO L226 Difference]: Without dead ends: 4094 [2019-12-26 21:54:12,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:54:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4094 states. [2019-12-26 21:54:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4094 to 2534. [2019-12-26 21:54:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-12-26 21:54:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 5513 transitions. [2019-12-26 21:54:12,979 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 5513 transitions. Word has length 27 [2019-12-26 21:54:12,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:12,980 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 5513 transitions. [2019-12-26 21:54:12,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:54:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 5513 transitions. [2019-12-26 21:54:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:54:12,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:12,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:12,985 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:12,986 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-12-26 21:54:12,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:12,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31026015] [2019-12-26 21:54:12,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:54:13,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31026015] [2019-12-26 21:54:13,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:13,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:54:13,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43449084] [2019-12-26 21:54:13,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:54:13,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:13,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:54:13,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:54:13,119 INFO L87 Difference]: Start difference. First operand 2534 states and 5513 transitions. Second operand 5 states. [2019-12-26 21:54:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:13,177 INFO L93 Difference]: Finished difference Result 1557 states and 3200 transitions. [2019-12-26 21:54:13,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:54:13,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 21:54:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:13,181 INFO L225 Difference]: With dead ends: 1557 [2019-12-26 21:54:13,181 INFO L226 Difference]: Without dead ends: 1300 [2019-12-26 21:54:13,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:54:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-12-26 21:54:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1205. [2019-12-26 21:54:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2019-12-26 21:54:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 2552 transitions. [2019-12-26 21:54:13,207 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 2552 transitions. Word has length 28 [2019-12-26 21:54:13,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:13,207 INFO L462 AbstractCegarLoop]: Abstraction has 1205 states and 2552 transitions. [2019-12-26 21:54:13,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:54:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 2552 transitions. [2019-12-26 21:54:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 21:54:13,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:13,212 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-26 21:54:13,212 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash -282366580, now seen corresponding path program 1 times [2019-12-26 21:54:13,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:13,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417424834] [2019-12-26 21:54:13,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:54:13,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417424834] [2019-12-26 21:54:13,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:13,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:54:13,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482251915] [2019-12-26 21:54:13,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:54:13,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:13,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:54:13,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:54:13,360 INFO L87 Difference]: Start difference. First operand 1205 states and 2552 transitions. Second operand 7 states. [2019-12-26 21:54:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:13,587 INFO L93 Difference]: Finished difference Result 2141 states and 4422 transitions. [2019-12-26 21:54:13,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:54:13,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 21:54:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:13,593 INFO L225 Difference]: With dead ends: 2141 [2019-12-26 21:54:13,594 INFO L226 Difference]: Without dead ends: 1428 [2019-12-26 21:54:13,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:54:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-26 21:54:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1210. [2019-12-26 21:54:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-12-26 21:54:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 2537 transitions. [2019-12-26 21:54:13,625 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 2537 transitions. Word has length 51 [2019-12-26 21:54:13,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:13,625 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 2537 transitions. [2019-12-26 21:54:13,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:54:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 2537 transitions. [2019-12-26 21:54:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 21:54:13,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:13,630 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-26 21:54:13,630 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:13,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:13,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1667743284, now seen corresponding path program 2 times [2019-12-26 21:54:13,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:13,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943354506] [2019-12-26 21:54:13,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:13,758 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-26 21:54:13,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943354506] [2019-12-26 21:54:13,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:13,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:54:13,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776661263] [2019-12-26 21:54:13,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:54:13,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:13,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:54:13,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:54:13,760 INFO L87 Difference]: Start difference. First operand 1210 states and 2537 transitions. Second operand 7 states. [2019-12-26 21:54:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:14,894 INFO L93 Difference]: Finished difference Result 2002 states and 4090 transitions. [2019-12-26 21:54:14,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 21:54:14,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 21:54:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:14,900 INFO L225 Difference]: With dead ends: 2002 [2019-12-26 21:54:14,900 INFO L226 Difference]: Without dead ends: 2002 [2019-12-26 21:54:14,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-26 21:54:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-12-26 21:54:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1222. [2019-12-26 21:54:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-26 21:54:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2571 transitions. [2019-12-26 21:54:14,931 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2571 transitions. Word has length 51 [2019-12-26 21:54:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:14,931 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 2571 transitions. [2019-12-26 21:54:14,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:54:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2571 transitions. [2019-12-26 21:54:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 21:54:14,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:14,935 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-26 21:54:14,935 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:14,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:14,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1259363204, now seen corresponding path program 3 times [2019-12-26 21:54:14,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:14,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312655684] [2019-12-26 21:54:14,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:15,094 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-26 21:54:15,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312655684] [2019-12-26 21:54:15,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:15,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:54:15,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837067631] [2019-12-26 21:54:15,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:54:15,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:15,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:54:15,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:54:15,096 INFO L87 Difference]: Start difference. First operand 1222 states and 2571 transitions. Second operand 5 states. [2019-12-26 21:54:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:15,325 INFO L93 Difference]: Finished difference Result 1351 states and 2804 transitions. [2019-12-26 21:54:15,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:54:15,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-26 21:54:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:15,330 INFO L225 Difference]: With dead ends: 1351 [2019-12-26 21:54:15,330 INFO L226 Difference]: Without dead ends: 1351 [2019-12-26 21:54:15,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:54:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-12-26 21:54:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1230. [2019-12-26 21:54:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-26 21:54:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2588 transitions. [2019-12-26 21:54:15,352 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2588 transitions. Word has length 51 [2019-12-26 21:54:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:15,352 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2588 transitions. [2019-12-26 21:54:15,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:54:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2588 transitions. [2019-12-26 21:54:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 21:54:15,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:15,356 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-26 21:54:15,356 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:15,357 INFO L82 PathProgramCache]: Analyzing trace with hash -878142292, now seen corresponding path program 4 times [2019-12-26 21:54:15,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:15,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057192719] [2019-12-26 21:54:15,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:15,452 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-26 21:54:15,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057192719] [2019-12-26 21:54:15,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:15,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:54:15,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166964732] [2019-12-26 21:54:15,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:15,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:15,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:15,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:15,454 INFO L87 Difference]: Start difference. First operand 1230 states and 2588 transitions. Second operand 3 states. [2019-12-26 21:54:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:15,469 INFO L93 Difference]: Finished difference Result 1229 states and 2586 transitions. [2019-12-26 21:54:15,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:15,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 21:54:15,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:15,473 INFO L225 Difference]: With dead ends: 1229 [2019-12-26 21:54:15,473 INFO L226 Difference]: Without dead ends: 1229 [2019-12-26 21:54:15,473 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-26 21:54:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2019-12-26 21:54:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1044. [2019-12-26 21:54:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2019-12-26 21:54:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 2239 transitions. [2019-12-26 21:54:15,492 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 2239 transitions. Word has length 51 [2019-12-26 21:54:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:15,492 INFO L462 AbstractCegarLoop]: Abstraction has 1044 states and 2239 transitions. [2019-12-26 21:54:15,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 2239 transitions. [2019-12-26 21:54:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 21:54:15,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:15,495 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-26 21:54:15,495 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2078058895, now seen corresponding path program 1 times [2019-12-26 21:54:15,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:15,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750110494] [2019-12-26 21:54:15,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:15,587 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-26 21:54:15,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750110494] [2019-12-26 21:54:15,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:15,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:54:15,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770207076] [2019-12-26 21:54:15,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:15,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:15,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:15,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:15,589 INFO L87 Difference]: Start difference. First operand 1044 states and 2239 transitions. Second operand 3 states. [2019-12-26 21:54:15,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:15,650 INFO L93 Difference]: Finished difference Result 1184 states and 2515 transitions. [2019-12-26 21:54:15,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:15,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 21:54:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:15,654 INFO L225 Difference]: With dead ends: 1184 [2019-12-26 21:54:15,654 INFO L226 Difference]: Without dead ends: 1184 [2019-12-26 21:54:15,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-12-26 21:54:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1000. [2019-12-26 21:54:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2019-12-26 21:54:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 2133 transitions. [2019-12-26 21:54:15,676 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 2133 transitions. Word has length 52 [2019-12-26 21:54:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:15,677 INFO L462 AbstractCegarLoop]: Abstraction has 1000 states and 2133 transitions. [2019-12-26 21:54:15,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 2133 transitions. [2019-12-26 21:54:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:54:15,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:15,680 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-26 21:54:15,681 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:15,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:15,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-26 21:54:15,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:15,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141324421] [2019-12-26 21:54:15,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:54:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:54:15,798 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:54:15,798 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:54:15,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t593~0.base_29| 1) |v_#valid_52|) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= v_~y$mem_tmp~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t593~0.base_29|) 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t593~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t593~0.base_29|) |v_ULTIMATE.start_main_~#t593~0.offset_20| 0)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t593~0.base_29|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t593~0.base_29| 4)) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= |v_ULTIMATE.start_main_~#t593~0.offset_20| 0) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_14|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_~#t593~0.base=|v_ULTIMATE.start_main_~#t593~0.base_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_17|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t593~0.offset=|v_ULTIMATE.start_main_~#t593~0.offset_20|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t593~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t594~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t593~0.offset, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 21:54:15,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12|) |v_ULTIMATE.start_main_~#t594~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t594~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t594~0.base_12|)) (= |v_ULTIMATE.start_main_~#t594~0.offset_10| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t594~0.base_12| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.base, ULTIMATE.start_main_~#t594~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 21:54:15,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66 0)) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 21:54:15,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1488712447 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1488712447 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1488712447| ~y$w_buff0_used~0_In1488712447) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1488712447|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1488712447, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1488712447} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1488712447|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1488712447, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1488712447} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 21:54:15,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1831782422 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out1831782422| ~y$w_buff0~0_In1831782422) (= |P1Thread1of1ForFork1_#t~ite14_In1831782422| |P1Thread1of1ForFork1_#t~ite14_Out1831782422|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1831782422 256)))) (or (and (= (mod ~y$w_buff1_used~0_In1831782422 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In1831782422 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In1831782422 256) 0))) (= ~y$w_buff0~0_In1831782422 |P1Thread1of1ForFork1_#t~ite14_Out1831782422|) (= |P1Thread1of1ForFork1_#t~ite15_Out1831782422| |P1Thread1of1ForFork1_#t~ite14_Out1831782422|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1831782422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1831782422, ~y$w_buff0~0=~y$w_buff0~0_In1831782422, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1831782422, ~weak$$choice2~0=~weak$$choice2~0_In1831782422, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1831782422|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1831782422} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1831782422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1831782422, ~y$w_buff0~0=~y$w_buff0~0_In1831782422, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1831782422, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1831782422|, ~weak$$choice2~0=~weak$$choice2~0_In1831782422, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1831782422|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1831782422} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 21:54:15,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-798268032 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_Out-798268032| |P1Thread1of1ForFork1_#t~ite18_Out-798268032|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-798268032 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-798268032 256)) (and .cse0 (= (mod ~y$w_buff1_used~0_In-798268032 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In-798268032 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite17_Out-798268032| ~y$w_buff1~0_In-798268032)) (and (= |P1Thread1of1ForFork1_#t~ite17_In-798268032| |P1Thread1of1ForFork1_#t~ite17_Out-798268032|) (= |P1Thread1of1ForFork1_#t~ite18_Out-798268032| ~y$w_buff1~0_In-798268032) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-798268032, ~y$w_buff1~0=~y$w_buff1~0_In-798268032, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-798268032, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-798268032, ~weak$$choice2~0=~weak$$choice2~0_In-798268032, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-798268032|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-798268032} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-798268032, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-798268032|, ~y$w_buff1~0=~y$w_buff1~0_In-798268032, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-798268032, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-798268032, ~weak$$choice2~0=~weak$$choice2~0_In-798268032, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-798268032|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-798268032} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-26 21:54:15,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In779692357 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In779692357 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In779692357 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In779692357 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out779692357| ~y$w_buff1_used~0_In779692357) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out779692357| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In779692357, ~y$w_buff0_used~0=~y$w_buff0_used~0_In779692357, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In779692357, ~y$w_buff1_used~0=~y$w_buff1_used~0_In779692357} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out779692357|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In779692357, ~y$w_buff0_used~0=~y$w_buff0_used~0_In779692357, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In779692357, ~y$w_buff1_used~0=~y$w_buff1_used~0_In779692357} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 21:54:15,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2004690565 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-2004690565 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-2004690565) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In-2004690565 ~y$r_buff0_thd1~0_Out-2004690565)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004690565, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2004690565} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004690565, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2004690565|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2004690565} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:54:15,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In234580286 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In234580286 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In234580286 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In234580286 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In234580286 |P0Thread1of1ForFork0_#t~ite8_Out234580286|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out234580286|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In234580286, ~y$w_buff0_used~0=~y$w_buff0_used~0_In234580286, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In234580286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In234580286} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In234580286, ~y$w_buff0_used~0=~y$w_buff0_used~0_In234580286, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out234580286|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In234580286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In234580286} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 21:54:15,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In104267199 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out104267199| |P1Thread1of1ForFork1_#t~ite20_Out104267199|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In104267199 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In104267199 256))) (= 0 (mod ~y$w_buff0_used~0_In104267199 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In104267199 256))))) (= |P1Thread1of1ForFork1_#t~ite20_Out104267199| ~y$w_buff0_used~0_In104267199)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out104267199| ~y$w_buff0_used~0_In104267199) (= |P1Thread1of1ForFork1_#t~ite20_In104267199| |P1Thread1of1ForFork1_#t~ite20_Out104267199|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In104267199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In104267199, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In104267199|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In104267199, ~weak$$choice2~0=~weak$$choice2~0_In104267199, ~y$w_buff1_used~0=~y$w_buff1_used~0_In104267199} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In104267199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In104267199, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out104267199|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In104267199, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out104267199|, ~weak$$choice2~0=~weak$$choice2~0_In104267199, ~y$w_buff1_used~0=~y$w_buff1_used~0_In104267199} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 21:54:15,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 21:54:15,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1888133092 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1888133092 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1888133092 256))) (= 0 (mod ~y$w_buff0_used~0_In1888133092 256)) (and .cse0 (= (mod ~y$w_buff1_used~0_In1888133092 256) 0)))) (= ~y$r_buff1_thd2~0_In1888133092 |P1Thread1of1ForFork1_#t~ite29_Out1888133092|) (= |P1Thread1of1ForFork1_#t~ite30_Out1888133092| |P1Thread1of1ForFork1_#t~ite29_Out1888133092|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In1888133092| |P1Thread1of1ForFork1_#t~ite29_Out1888133092|) (= ~y$r_buff1_thd2~0_In1888133092 |P1Thread1of1ForFork1_#t~ite30_Out1888133092|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1888133092, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1888133092|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1888133092, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1888133092, ~weak$$choice2~0=~weak$$choice2~0_In1888133092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1888133092} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1888133092, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1888133092|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1888133092|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1888133092, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1888133092, ~weak$$choice2~0=~weak$$choice2~0_In1888133092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1888133092} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 21:54:15,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:54:15,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-26 21:54:15,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1049429495 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1049429495 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1049429495 |P1Thread1of1ForFork1_#t~ite32_Out-1049429495|) (not .cse1)) (and (= ~y~0_In-1049429495 |P1Thread1of1ForFork1_#t~ite32_Out-1049429495|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1049429495, ~y$w_buff1~0=~y$w_buff1~0_In-1049429495, ~y~0=~y~0_In-1049429495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1049429495} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1049429495, ~y$w_buff1~0=~y$w_buff1~0_In-1049429495, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1049429495|, ~y~0=~y~0_In-1049429495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1049429495} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 21:54:15,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-26 21:54:15,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1403640428 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1403640428 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1403640428| ~y$w_buff0_used~0_In-1403640428) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1403640428| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1403640428, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1403640428} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1403640428, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1403640428, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1403640428|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 21:54:15,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-1352510425 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1352510425 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1352510425 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1352510425 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1352510425| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1352510425| ~y$w_buff1_used~0_In-1352510425) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1352510425, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1352510425, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1352510425, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1352510425} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1352510425, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1352510425, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1352510425, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1352510425|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1352510425} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 21:54:15,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In662536514 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In662536514 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out662536514| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out662536514| ~y$r_buff0_thd2~0_In662536514) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In662536514, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In662536514} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In662536514, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In662536514, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out662536514|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 21:54:15,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In459641428 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In459641428 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In459641428 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In459641428 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out459641428|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In459641428 |P1Thread1of1ForFork1_#t~ite37_Out459641428|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In459641428, ~y$w_buff0_used~0=~y$w_buff0_used~0_In459641428, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In459641428, ~y$w_buff1_used~0=~y$w_buff1_used~0_In459641428} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In459641428, ~y$w_buff0_used~0=~y$w_buff0_used~0_In459641428, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In459641428, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out459641428|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In459641428} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 21:54:15,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 21:54:15,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 21:54:15,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-580827270 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-580827270 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-580827270| ~y$w_buff1~0_In-580827270) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-580827270| ~y~0_In-580827270)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-580827270, ~y~0=~y~0_In-580827270, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-580827270, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-580827270} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-580827270|, ~y$w_buff1~0=~y$w_buff1~0_In-580827270, ~y~0=~y~0_In-580827270, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-580827270, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-580827270} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 21:54:15,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-26 21:54:15,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1401955782 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1401955782 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1401955782 |ULTIMATE.start_main_#t~ite42_Out1401955782|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1401955782| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1401955782, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1401955782} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1401955782, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1401955782, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1401955782|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 21:54:15,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In654734632 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In654734632 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In654734632 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In654734632 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out654734632|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In654734632 |ULTIMATE.start_main_#t~ite43_Out654734632|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In654734632, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In654734632, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In654734632, ~y$w_buff1_used~0=~y$w_buff1_used~0_In654734632} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In654734632, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In654734632, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out654734632|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In654734632, ~y$w_buff1_used~0=~y$w_buff1_used~0_In654734632} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 21:54:15,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-19180959 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-19180959 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-19180959|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-19180959 |ULTIMATE.start_main_#t~ite44_Out-19180959|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-19180959, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-19180959} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-19180959, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-19180959, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-19180959|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 21:54:15,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-871706689 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-871706689 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-871706689 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-871706689 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-871706689 |ULTIMATE.start_main_#t~ite45_Out-871706689|)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-871706689|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-871706689, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-871706689, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-871706689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-871706689} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-871706689, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-871706689, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-871706689, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-871706689|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-871706689} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 21:54:15,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EBX~0_24 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:54:15,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:54:15 BasicIcfg [2019-12-26 21:54:15,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:54:15,880 INFO L168 Benchmark]: Toolchain (without parser) took 15820.16 ms. Allocated memory was 143.7 MB in the beginning and 514.9 MB in the end (delta: 371.2 MB). Free memory was 100.1 MB in the beginning and 255.1 MB in the end (delta: -155.0 MB). Peak memory consumption was 216.2 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:15,881 INFO L168 Benchmark]: CDTParser took 1.52 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 21:54:15,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.94 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 154.7 MB in the end (delta: -55.0 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:15,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.09 ms. Allocated memory is still 200.8 MB. Free memory was 154.7 MB in the beginning and 151.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:15,883 INFO L168 Benchmark]: Boogie Preprocessor took 37.76 ms. Allocated memory is still 200.8 MB. Free memory was 151.9 MB in the beginning and 149.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:15,883 INFO L168 Benchmark]: RCFGBuilder took 803.00 ms. Allocated memory is still 200.8 MB. Free memory was 149.8 MB in the beginning and 105.4 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:15,884 INFO L168 Benchmark]: TraceAbstraction took 14129.15 ms. Allocated memory was 200.8 MB in the beginning and 514.9 MB in the end (delta: 314.0 MB). Free memory was 104.7 MB in the beginning and 255.1 MB in the end (delta: -150.4 MB). Peak memory consumption was 163.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:15,888 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.52 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 782.94 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 154.7 MB in the end (delta: -55.0 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.09 ms. Allocated memory is still 200.8 MB. Free memory was 154.7 MB in the beginning and 151.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.76 ms. Allocated memory is still 200.8 MB. Free memory was 151.9 MB in the beginning and 149.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 803.00 ms. Allocated memory is still 200.8 MB. Free memory was 149.8 MB in the beginning and 105.4 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14129.15 ms. Allocated memory was 200.8 MB in the beginning and 514.9 MB in the end (delta: 314.0 MB). Free memory was 104.7 MB in the beginning and 255.1 MB in the end (delta: -150.4 MB). Peak memory consumption was 163.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1878 SDtfs, 2229 SDslu, 3482 SDs, 0 SdLazy, 2433 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 27 SyntacticMatches, 11 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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: 1.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 6658 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 84807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...