/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/mix048_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:47:35,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:47:35,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:47:35,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:47:35,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:47:35,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:47:35,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:47:35,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:47:35,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:47:35,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:47:35,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:47:35,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:47:35,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:47:35,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:47:35,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:47:35,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:47:35,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:47:35,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:47:35,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:47:35,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:47:35,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:47:35,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:47:35,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:47:35,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:47:35,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:47:35,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:47:35,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:47:35,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:47:35,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:47:35,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:47:35,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:47:35,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:47:35,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:47:35,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:47:35,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:47:35,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:47:35,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:47:35,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:47:35,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:47:35,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:47:35,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:47:35,751 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 22:47:35,764 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:47:35,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:47:35,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:47:35,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:47:35,766 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:47:35,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:47:35,767 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:47:35,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:47:35,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:47:35,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:47:35,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:47:35,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:47:35,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:47:35,768 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:47:35,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:47:35,768 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:47:35,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:47:35,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:47:35,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:47:35,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:47:35,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:47:35,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:47:35,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:47:35,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:47:35,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:47:35,770 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:47:35,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:47:35,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:47:35,771 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:47:35,771 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:47:36,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:47:36,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:47:36,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:47:36,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:47:36,076 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:47:36,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_rmo.opt.i [2019-12-26 22:47:36,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9baa0e963/125bdc3dd0c4446d8644a9fb75064b4e/FLAG0619af909 [2019-12-26 22:47:36,747 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:47:36,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_rmo.opt.i [2019-12-26 22:47:36,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9baa0e963/125bdc3dd0c4446d8644a9fb75064b4e/FLAG0619af909 [2019-12-26 22:47:37,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9baa0e963/125bdc3dd0c4446d8644a9fb75064b4e [2019-12-26 22:47:37,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:47:37,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:47:37,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:47:37,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:47:37,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:47:37,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:47:37" (1/1) ... [2019-12-26 22:47:37,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37, skipping insertion in model container [2019-12-26 22:47:37,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:47:37" (1/1) ... [2019-12-26 22:47:37,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:47:37,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:47:37,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:47:37,562 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:47:37,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:47:37,723 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:47:37,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37 WrapperNode [2019-12-26 22:47:37,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:47:37,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:47:37,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:47:37,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:47:37,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37" (1/1) ... [2019-12-26 22:47:37,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37" (1/1) ... [2019-12-26 22:47:37,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:47:37,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:47:37,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:47:37,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:47:37,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37" (1/1) ... [2019-12-26 22:47:37,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37" (1/1) ... [2019-12-26 22:47:37,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37" (1/1) ... [2019-12-26 22:47:37,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37" (1/1) ... [2019-12-26 22:47:37,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37" (1/1) ... [2019-12-26 22:47:37,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37" (1/1) ... [2019-12-26 22:47:37,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37" (1/1) ... [2019-12-26 22:47:37,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:47:37,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:47:37,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:47:37,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:47:37,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37" (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 22:47:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:47:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:47:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:47:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:47:37,940 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:47:37,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:47:37,940 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:47:37,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:47:37,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:47:37,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:47:37,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:47:37,945 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 22:47:38,610 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:47:38,610 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:47:38,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:47:38 BoogieIcfgContainer [2019-12-26 22:47:38,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:47:38,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:47:38,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:47:38,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:47:38,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:47:37" (1/3) ... [2019-12-26 22:47:38,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4521bf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:47:38, skipping insertion in model container [2019-12-26 22:47:38,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:37" (2/3) ... [2019-12-26 22:47:38,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4521bf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:47:38, skipping insertion in model container [2019-12-26 22:47:38,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:47:38" (3/3) ... [2019-12-26 22:47:38,620 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_rmo.opt.i [2019-12-26 22:47:38,630 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:47:38,631 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:47:38,640 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:47:38,641 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:47:38,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,677 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,678 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,678 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,689 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,689 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,730 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,749 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:38,768 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 22:47:38,787 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:47:38,788 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:47:38,788 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:47:38,788 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:47:38,788 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:47:38,788 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:47:38,788 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:47:38,788 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:47:38,805 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-26 22:47:38,807 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 22:47:38,927 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 22:47:38,928 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:47:38,947 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 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:47:38,964 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 22:47:39,047 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 22:47:39,048 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:47:39,057 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 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:47:39,069 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 22:47:39,070 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:47:44,050 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 22:47:44,159 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-26 22:47:44,227 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-26 22:47:44,227 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-26 22:47:44,230 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-26 22:47:44,635 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-26 22:47:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-26 22:47:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:47:44,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:44,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:47:44,646 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:44,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:44,652 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-26 22:47:44,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:44,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585810784] [2019-12-26 22:47:44,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:44,968 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 22:47:44,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585810784] [2019-12-26 22:47:44,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:44,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:47:44,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183631888] [2019-12-26 22:47:44,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:47:44,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:45,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:47:45,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:45,005 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-26 22:47:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:45,256 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-26 22:47:45,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:47:45,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:47:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:45,369 INFO L225 Difference]: With dead ends: 8074 [2019-12-26 22:47:45,369 INFO L226 Difference]: Without dead ends: 7606 [2019-12-26 22:47:45,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:45,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-26 22:47:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-26 22:47:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-26 22:47:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-26 22:47:45,856 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-26 22:47:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:45,856 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-26 22:47:45,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:47:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-26 22:47:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:47:45,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:45,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:45,863 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:45,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:45,864 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-26 22:47:45,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:45,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218013476] [2019-12-26 22:47:45,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:46,013 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 22:47:46,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218013476] [2019-12-26 22:47:46,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:46,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:47:46,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437393833] [2019-12-26 22:47:46,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:47:46,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:46,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:47:46,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:47:46,018 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-26 22:47:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:46,721 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-26 22:47:46,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:47:46,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:47:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:46,834 INFO L225 Difference]: With dead ends: 11630 [2019-12-26 22:47:46,834 INFO L226 Difference]: Without dead ends: 11623 [2019-12-26 22:47:46,836 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 22:47:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-26 22:47:47,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-26 22:47:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-26 22:47:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-26 22:47:47,326 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-26 22:47:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:47,327 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-26 22:47:47,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:47:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-26 22:47:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:47:47,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:47,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:47,341 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:47,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:47,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-26 22:47:47,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:47,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103322287] [2019-12-26 22:47:47,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:47,467 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 22:47:47,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103322287] [2019-12-26 22:47:47,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:47,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:47:47,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504348957] [2019-12-26 22:47:47,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:47:47,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:47:47,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:47:47,469 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-26 22:47:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:47,901 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-26 22:47:47,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:47:47,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 22:47:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:47,952 INFO L225 Difference]: With dead ends: 14471 [2019-12-26 22:47:47,952 INFO L226 Difference]: Without dead ends: 14471 [2019-12-26 22:47:47,953 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 22:47:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-26 22:47:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-26 22:47:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-26 22:47:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-26 22:47:48,369 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-26 22:47:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:48,371 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-26 22:47:48,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:47:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-26 22:47:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:47:48,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:48,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:48,375 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:48,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:48,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-26 22:47:48,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:48,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735625262] [2019-12-26 22:47:48,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:48,454 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 22:47:48,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735625262] [2019-12-26 22:47:48,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:48,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:47:48,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160282556] [2019-12-26 22:47:48,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:47:48,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:48,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:47:48,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:48,456 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-26 22:47:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:48,528 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-26 22:47:48,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:47:48,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 22:47:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:48,574 INFO L225 Difference]: With dead ends: 10750 [2019-12-26 22:47:48,577 INFO L226 Difference]: Without dead ends: 10750 [2019-12-26 22:47:48,578 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 22:47:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-26 22:47:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-26 22:47:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-26 22:47:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-26 22:47:49,505 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-26 22:47:49,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:49,505 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-26 22:47:49,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:47:49,505 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-26 22:47:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:47:49,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:49,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:49,508 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:49,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:49,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-26 22:47:49,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:49,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179207031] [2019-12-26 22:47:49,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:49,573 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 22:47:49,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179207031] [2019-12-26 22:47:49,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:49,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:47:49,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446629367] [2019-12-26 22:47:49,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:47:49,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:49,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:47:49,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:47:49,576 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-12-26 22:47:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:49,609 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-12-26 22:47:49,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:47:49,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:47:49,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:49,613 INFO L225 Difference]: With dead ends: 2054 [2019-12-26 22:47:49,614 INFO L226 Difference]: Without dead ends: 1457 [2019-12-26 22:47:49,614 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 22:47:49,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-12-26 22:47:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-12-26 22:47:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-12-26 22:47:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-12-26 22:47:49,645 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-12-26 22:47:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:49,645 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-12-26 22:47:49,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:47:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-12-26 22:47:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 22:47:49,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:49,647 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] [2019-12-26 22:47:49,648 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:49,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:49,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-26 22:47:49,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:49,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689023689] [2019-12-26 22:47:49,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:49,784 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 22:47:49,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689023689] [2019-12-26 22:47:49,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:49,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:47:49,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939831559] [2019-12-26 22:47:49,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:47:49,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:49,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:47:49,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:47:49,787 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-12-26 22:47:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:50,131 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-12-26 22:47:50,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:47:50,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-26 22:47:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:50,138 INFO L225 Difference]: With dead ends: 2249 [2019-12-26 22:47:50,138 INFO L226 Difference]: Without dead ends: 2197 [2019-12-26 22:47:50,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:47:50,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-12-26 22:47:50,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-12-26 22:47:50,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-26 22:47:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-12-26 22:47:50,168 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-12-26 22:47:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:50,168 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-12-26 22:47:50,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:47:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-12-26 22:47:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:47:50,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:50,171 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 22:47:50,171 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:50,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-26 22:47:50,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:50,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845134485] [2019-12-26 22:47:50,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:50,256 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 22:47:50,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845134485] [2019-12-26 22:47:50,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:50,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:47:50,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125129024] [2019-12-26 22:47:50,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:47:50,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:50,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:47:50,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:47:50,258 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 5 states. [2019-12-26 22:47:50,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:50,299 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-12-26 22:47:50,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:47:50,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 22:47:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:50,302 INFO L225 Difference]: With dead ends: 752 [2019-12-26 22:47:50,302 INFO L226 Difference]: Without dead ends: 689 [2019-12-26 22:47:50,303 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 22:47:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-12-26 22:47:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-12-26 22:47:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-26 22:47:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-26 22:47:50,315 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-12-26 22:47:50,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:50,315 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-26 22:47:50,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:47:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-26 22:47:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:47:50,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:50,318 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 22:47:50,318 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:50,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:50,319 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-26 22:47:50,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:50,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657477277] [2019-12-26 22:47:50,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:50,421 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 22:47:50,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657477277] [2019-12-26 22:47:50,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:50,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:47:50,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352679158] [2019-12-26 22:47:50,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:47:50,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:50,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:47:50,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:47:50,424 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 4 states. [2019-12-26 22:47:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:50,441 INFO L93 Difference]: Finished difference Result 1118 states and 2458 transitions. [2019-12-26 22:47:50,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:47:50,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-26 22:47:50,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:50,444 INFO L225 Difference]: With dead ends: 1118 [2019-12-26 22:47:50,444 INFO L226 Difference]: Without dead ends: 471 [2019-12-26 22:47:50,444 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 22:47:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-26 22:47:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-12-26 22:47:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-12-26 22:47:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1036 transitions. [2019-12-26 22:47:50,453 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1036 transitions. Word has length 51 [2019-12-26 22:47:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:50,455 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 1036 transitions. [2019-12-26 22:47:50,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:47:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1036 transitions. [2019-12-26 22:47:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:47:50,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:50,457 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 22:47:50,457 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:50,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1382412251, now seen corresponding path program 2 times [2019-12-26 22:47:50,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:50,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604574150] [2019-12-26 22:47:50,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:50,658 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 22:47:50,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604574150] [2019-12-26 22:47:50,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:50,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:47:50,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863693718] [2019-12-26 22:47:50,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:47:50,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:50,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:47:50,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:47:50,662 INFO L87 Difference]: Start difference. First operand 471 states and 1036 transitions. Second operand 7 states. [2019-12-26 22:47:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:50,848 INFO L93 Difference]: Finished difference Result 982 states and 2086 transitions. [2019-12-26 22:47:50,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:47:50,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 22:47:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:50,852 INFO L225 Difference]: With dead ends: 982 [2019-12-26 22:47:50,852 INFO L226 Difference]: Without dead ends: 683 [2019-12-26 22:47:50,853 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 22:47:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-26 22:47:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 529. [2019-12-26 22:47:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-26 22:47:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1137 transitions. [2019-12-26 22:47:50,863 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1137 transitions. Word has length 51 [2019-12-26 22:47:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:50,863 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1137 transitions. [2019-12-26 22:47:50,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:47:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1137 transitions. [2019-12-26 22:47:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:47:50,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:50,866 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 22:47:50,866 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:50,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:50,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1158154681, now seen corresponding path program 3 times [2019-12-26 22:47:50,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:50,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926052336] [2019-12-26 22:47:50,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:51,013 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 22:47:51,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926052336] [2019-12-26 22:47:51,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:51,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:47:51,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356453388] [2019-12-26 22:47:51,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:47:51,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:51,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:47:51,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:47:51,015 INFO L87 Difference]: Start difference. First operand 529 states and 1137 transitions. Second operand 5 states. [2019-12-26 22:47:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:51,411 INFO L93 Difference]: Finished difference Result 885 states and 1849 transitions. [2019-12-26 22:47:51,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:47:51,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-26 22:47:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:51,415 INFO L225 Difference]: With dead ends: 885 [2019-12-26 22:47:51,416 INFO L226 Difference]: Without dead ends: 861 [2019-12-26 22:47:51,416 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 22:47:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-26 22:47:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 712. [2019-12-26 22:47:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-12-26 22:47:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1532 transitions. [2019-12-26 22:47:51,429 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1532 transitions. Word has length 51 [2019-12-26 22:47:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:51,430 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1532 transitions. [2019-12-26 22:47:51,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:47:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1532 transitions. [2019-12-26 22:47:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:47:51,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:51,433 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 22:47:51,433 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash -320603405, now seen corresponding path program 4 times [2019-12-26 22:47:51,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:51,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635744429] [2019-12-26 22:47:51,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:51,507 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 22:47:51,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635744429] [2019-12-26 22:47:51,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:51,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:47:51,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404828651] [2019-12-26 22:47:51,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:47:51,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:51,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:47:51,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:51,510 INFO L87 Difference]: Start difference. First operand 712 states and 1532 transitions. Second operand 3 states. [2019-12-26 22:47:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:51,567 INFO L93 Difference]: Finished difference Result 923 states and 1980 transitions. [2019-12-26 22:47:51,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:47:51,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 22:47:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:51,572 INFO L225 Difference]: With dead ends: 923 [2019-12-26 22:47:51,572 INFO L226 Difference]: Without dead ends: 923 [2019-12-26 22:47:51,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-26 22:47:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 754. [2019-12-26 22:47:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-26 22:47:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-26 22:47:51,586 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-26 22:47:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:51,586 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-26 22:47:51,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:47:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-26 22:47:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:47:51,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:51,589 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 22:47:51,589 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:51,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:51,590 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-26 22:47:51,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:51,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379031188] [2019-12-26 22:47:51,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:47:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:47:51,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:47:51,755 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:47:51,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1291~0.base_40|)) (= v_~y$read_delayed~0_6 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1291~0.base_40| 4)) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1291~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1291~0.base_40|) |v_ULTIMATE.start_main_~#t1291~0.offset_27| 0)) |v_#memory_int_17|) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1291~0.base_40| 1)) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= |v_ULTIMATE.start_main_~#t1291~0.offset_27| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1291~0.base_40|) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ULTIMATE.start_main_~#t1292~0.offset=|v_ULTIMATE.start_main_~#t1292~0.offset_27|, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ULTIMATE.start_main_~#t1292~0.base=|v_ULTIMATE.start_main_~#t1292~0.base_41|, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1291~0.offset=|v_ULTIMATE.start_main_~#t1291~0.offset_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1291~0.base=|v_ULTIMATE.start_main_~#t1291~0.base_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~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_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1292~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1292~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1291~0.offset, ~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, ULTIMATE.start_main_~#t1291~0.base, ~__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 22:47:51,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1292~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1292~0.base_13|) |v_ULTIMATE.start_main_~#t1292~0.offset_11| 1)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1292~0.base_13|)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1292~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1292~0.base_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1292~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1292~0.offset_11| 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1292~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1292~0.offset=|v_ULTIMATE.start_main_~#t1292~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1292~0.base=|v_ULTIMATE.start_main_~#t1292~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1292~0.offset, ULTIMATE.start_main_~#t1292~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 22:47:51,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~__unbuffered_p0_EAX~0_Out-1060030513 ~x~0_In-1060030513) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1060030513)) (= ~y$r_buff0_thd1~0_In-1060030513 ~y$r_buff1_thd1~0_Out-1060030513) (= ~y$r_buff0_thd1~0_Out-1060030513 1) (= ~y$r_buff1_thd2~0_Out-1060030513 ~y$r_buff0_thd2~0_In-1060030513) (= ~y$r_buff1_thd0~0_Out-1060030513 ~y$r_buff0_thd0~0_In-1060030513)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1060030513, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1060030513, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1060030513, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1060030513, ~x~0=~x~0_In-1060030513} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1060030513, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1060030513, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1060030513, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1060030513, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1060030513, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1060030513, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1060030513, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1060030513, ~x~0=~x~0_In-1060030513} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 22:47:51,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In768370385 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In768370385 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In768370385 |P0Thread1of1ForFork0_#t~ite5_Out768370385|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out768370385|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In768370385, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In768370385} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out768370385|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In768370385, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In768370385} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:47:51,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1434888566 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In1434888566| |P1Thread1of1ForFork1_#t~ite20_Out1434888566|) (not .cse0) (= ~y$w_buff0_used~0_In1434888566 |P1Thread1of1ForFork1_#t~ite21_Out1434888566|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1434888566 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1434888566 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1434888566 256)) (and (= (mod ~y$r_buff1_thd2~0_In1434888566 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out1434888566| |P1Thread1of1ForFork1_#t~ite21_Out1434888566|) (= ~y$w_buff0_used~0_In1434888566 |P1Thread1of1ForFork1_#t~ite20_Out1434888566|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1434888566, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1434888566, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1434888566|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1434888566, ~weak$$choice2~0=~weak$$choice2~0_In1434888566, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1434888566} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1434888566, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1434888566, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1434888566|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1434888566, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1434888566|, ~weak$$choice2~0=~weak$$choice2~0_In1434888566, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1434888566} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 22:47:51,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse4 (= (mod ~y$w_buff1_used~0_In-1562582470 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out-1562582470| |P1Thread1of1ForFork1_#t~ite23_Out-1562582470|)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1562582470 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1562582470 256))) (.cse0 (= (mod ~weak$$choice2~0_In-1562582470 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1562582470 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-1562582470| |P1Thread1of1ForFork1_#t~ite22_Out-1562582470|) (or (and (= ~y$w_buff1_used~0_In-1562582470 |P1Thread1of1ForFork1_#t~ite24_Out-1562582470|) (= |P1Thread1of1ForFork1_#t~ite23_Out-1562582470| |P1Thread1of1ForFork1_#t~ite23_In-1562582470|) (not .cse0)) (and (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4)) .cse5 (= ~y$w_buff1_used~0_In-1562582470 |P1Thread1of1ForFork1_#t~ite23_Out-1562582470|) .cse0))) (let ((.cse6 (not .cse2))) (and (or (not .cse4) .cse6) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1562582470|) .cse5 (not .cse1) (or (not .cse3) .cse6) (= |P1Thread1of1ForFork1_#t~ite23_Out-1562582470| |P1Thread1of1ForFork1_#t~ite22_Out-1562582470|) .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1562582470, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1562582470, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1562582470, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1562582470|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1562582470|, ~weak$$choice2~0=~weak$$choice2~0_In-1562582470, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1562582470} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1562582470, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1562582470, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1562582470, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1562582470|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1562582470|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1562582470|, ~weak$$choice2~0=~weak$$choice2~0_In-1562582470, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1562582470} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-26 22:47:51,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In114492681 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In114492681 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In114492681 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In114492681 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out114492681|)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out114492681| ~y$w_buff1_used~0_In114492681) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In114492681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In114492681, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In114492681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In114492681} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out114492681|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In114492681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In114492681, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In114492681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In114492681} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:47:51,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In347345645 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In347345645 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out347345645) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In347345645 ~y$r_buff0_thd1~0_Out347345645) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In347345645, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In347345645} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In347345645, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out347345645|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out347345645} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:47:51,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-13221077 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-13221077 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-13221077 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-13221077 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In-13221077 |P0Thread1of1ForFork0_#t~ite8_Out-13221077|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-13221077|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-13221077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-13221077, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-13221077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-13221077} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-13221077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-13221077, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-13221077|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-13221077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-13221077} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:47:51,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 22:47:51,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-751815780 256)))) (or (and (= ~y$r_buff1_thd2~0_In-751815780 |P1Thread1of1ForFork1_#t~ite30_Out-751815780|) (= |P1Thread1of1ForFork1_#t~ite29_In-751815780| |P1Thread1of1ForFork1_#t~ite29_Out-751815780|) (not .cse0)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-751815780 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-751815780 256)) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-751815780 256))) (= 0 (mod ~y$w_buff0_used~0_In-751815780 256)))) (= ~y$r_buff1_thd2~0_In-751815780 |P1Thread1of1ForFork1_#t~ite29_Out-751815780|) (= |P1Thread1of1ForFork1_#t~ite30_Out-751815780| |P1Thread1of1ForFork1_#t~ite29_Out-751815780|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-751815780, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-751815780|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-751815780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-751815780, ~weak$$choice2~0=~weak$$choice2~0_In-751815780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-751815780} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-751815780, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-751815780|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-751815780|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-751815780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-751815780, ~weak$$choice2~0=~weak$$choice2~0_In-751815780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-751815780} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 22:47:51,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} 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_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-26 22:47:51,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In580693653 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In580693653 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out580693653| ~y~0_In580693653)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out580693653| ~y$w_buff1~0_In580693653) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In580693653, ~y$w_buff1~0=~y$w_buff1~0_In580693653, ~y~0=~y~0_In580693653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In580693653} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In580693653, ~y$w_buff1~0=~y$w_buff1~0_In580693653, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out580693653|, ~y~0=~y~0_In580693653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In580693653} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 22:47:51,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-26 22:47:51,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-284010474 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-284010474 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-284010474 |P1Thread1of1ForFork1_#t~ite34_Out-284010474|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-284010474|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-284010474, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-284010474} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-284010474, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-284010474, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-284010474|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 22:47:51,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1004366760 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1004366760 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1004366760 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1004366760 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1004366760 |P1Thread1of1ForFork1_#t~ite35_Out1004366760|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1004366760|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1004366760, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1004366760, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1004366760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1004366760} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1004366760, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1004366760, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1004366760, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1004366760|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1004366760} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 22:47:51,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1789604176 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1789604176 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1789604176| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1789604176| ~y$r_buff0_thd2~0_In-1789604176)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1789604176, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1789604176} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1789604176, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1789604176, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1789604176|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 22:47:51,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-23097393 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-23097393 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-23097393 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-23097393 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-23097393 |P1Thread1of1ForFork1_#t~ite37_Out-23097393|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-23097393| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-23097393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23097393, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-23097393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23097393} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-23097393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23097393, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-23097393, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-23097393|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23097393} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 22:47:51,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} 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 22:47:51,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} 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 22:47:51,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 22:47:51,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1406914138 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1406914138 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1406914138| ~y$w_buff1~0_In1406914138) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1406914138| ~y~0_In1406914138)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1406914138, ~y~0=~y~0_In1406914138, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1406914138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1406914138} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1406914138|, ~y$w_buff1~0=~y$w_buff1~0_In1406914138, ~y~0=~y~0_In1406914138, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1406914138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1406914138} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:47:51,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-26 22:47:51,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1044861347 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1044861347 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1044861347| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1044861347 |ULTIMATE.start_main_#t~ite42_Out1044861347|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1044861347, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1044861347} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1044861347, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1044861347, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1044861347|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:47:51,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In958380813 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In958380813 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In958380813 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In958380813 256) 0))) (or (and (= ~y$w_buff1_used~0_In958380813 |ULTIMATE.start_main_#t~ite43_Out958380813|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite43_Out958380813| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In958380813, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In958380813, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In958380813, ~y$w_buff1_used~0=~y$w_buff1_used~0_In958380813} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In958380813, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In958380813, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out958380813|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In958380813, ~y$w_buff1_used~0=~y$w_buff1_used~0_In958380813} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 22:47:51,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In901526130 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In901526130 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out901526130|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In901526130 |ULTIMATE.start_main_#t~ite44_Out901526130|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In901526130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In901526130} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In901526130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In901526130, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out901526130|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:47:51,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In855777416 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In855777416 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In855777416 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In855777416 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In855777416 |ULTIMATE.start_main_#t~ite45_Out855777416|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite45_Out855777416|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In855777416, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In855777416, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In855777416, ~y$w_buff1_used~0=~y$w_buff1_used~0_In855777416} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In855777416, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In855777416, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In855777416, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out855777416|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In855777416} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:47:51,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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 22:47:51,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:47:51 BasicIcfg [2019-12-26 22:47:51,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:47:51,876 INFO L168 Benchmark]: Toolchain (without parser) took 14862.69 ms. Allocated memory was 144.2 MB in the beginning and 610.3 MB in the end (delta: 466.1 MB). Free memory was 98.9 MB in the beginning and 300.9 MB in the end (delta: -202.0 MB). Peak memory consumption was 264.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:51,877 INFO L168 Benchmark]: CDTParser took 1.53 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:47:51,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.56 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 98.6 MB in the beginning and 156.4 MB in the end (delta: -57.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:51,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.98 ms. Allocated memory is still 201.9 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:51,880 INFO L168 Benchmark]: Boogie Preprocessor took 65.36 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 151.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:51,880 INFO L168 Benchmark]: RCFGBuilder took 746.42 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 107.0 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:51,881 INFO L168 Benchmark]: TraceAbstraction took 13261.53 ms. Allocated memory was 201.9 MB in the beginning and 610.3 MB in the end (delta: 408.4 MB). Free memory was 106.3 MB in the beginning and 300.9 MB in the end (delta: -194.5 MB). Peak memory consumption was 213.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:51,886 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.53 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 709.56 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 98.6 MB in the beginning and 156.4 MB in the end (delta: -57.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.98 ms. Allocated memory is still 201.9 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.36 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 151.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 746.42 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 107.0 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13261.53 ms. Allocated memory was 201.9 MB in the beginning and 610.3 MB in the end (delta: 408.4 MB). Free memory was 106.3 MB in the beginning and 300.9 MB in the end (delta: -194.5 MB). Peak memory consumption was 213.9 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, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1291, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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 [L796] FCALL, FORK 0 pthread_create(&t1292, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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=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 = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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] [L759] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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) [L759] 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) [L760] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=1, x=1, 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] [L760] 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)) [L761] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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 : (!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))=0, x=1, 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] [L761] 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)) [L762] 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)) [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$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)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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] [L771] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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: 12.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1295 SDtfs, 1438 SDslu, 2194 SDs, 0 SdLazy, 1138 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 5640 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 33998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...