/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:46:41,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:46:41,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:46:41,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:46:41,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:46:41,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:46:41,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:46:41,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:46:41,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:46:41,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:46:41,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:46:41,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:46:41,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:46:41,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:46:41,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:46:41,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:46:41,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:46:41,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:46:41,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:46:41,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:46:41,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:46:41,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:46:41,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:46:41,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:46:41,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:46:41,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:46:41,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:46:41,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:46:41,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:46:41,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:46:41,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:46:41,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:46:41,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:46:41,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:46:41,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:46:41,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:46:41,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:46:41,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:46:41,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:46:41,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:46:41,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:46:41,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:46:41,803 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:46:41,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:46:41,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:46:41,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:46:41,804 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:46:41,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:46:41,805 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:46:41,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:46:41,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:46:41,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:46:41,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:46:41,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:46:41,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:46:41,806 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:46:41,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:46:41,807 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:46:41,808 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:46:41,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:46:41,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:46:41,808 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:46:41,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:46:41,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:46:41,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:46:41,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:46:41,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:46:41,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:46:41,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:46:41,811 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:46:41,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:46:41,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:46:42,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:46:42,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:46:42,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:46:42,094 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:46:42,094 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:46:42,095 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i [2019-12-27 05:46:42,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f12300c/cff345d610eb468ab5287419aad964aa/FLAGd40f7abb3 [2019-12-27 05:46:42,765 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:46:42,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i [2019-12-27 05:46:42,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f12300c/cff345d610eb468ab5287419aad964aa/FLAGd40f7abb3 [2019-12-27 05:46:43,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f12300c/cff345d610eb468ab5287419aad964aa [2019-12-27 05:46:43,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:46:43,034 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:46:43,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:46:43,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:46:43,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:46:43,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:46:43" (1/1) ... [2019-12-27 05:46:43,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b6a1a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43, skipping insertion in model container [2019-12-27 05:46:43,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:46:43" (1/1) ... [2019-12-27 05:46:43,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:46:43,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:46:43,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:46:43,616 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:46:43,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:46:43,788 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:46:43,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43 WrapperNode [2019-12-27 05:46:43,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:46:43,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:46:43,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:46:43,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:46:43,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43" (1/1) ... [2019-12-27 05:46:43,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43" (1/1) ... [2019-12-27 05:46:43,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:46:43,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:46:43,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:46:43,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:46:43,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43" (1/1) ... [2019-12-27 05:46:43,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43" (1/1) ... [2019-12-27 05:46:43,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43" (1/1) ... [2019-12-27 05:46:43,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43" (1/1) ... [2019-12-27 05:46:43,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43" (1/1) ... [2019-12-27 05:46:43,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43" (1/1) ... [2019-12-27 05:46:43,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43" (1/1) ... [2019-12-27 05:46:43,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:46:43,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:46:43,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:46:43,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:46:43,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:46:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:46:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:46:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:46:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:46:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:46:43,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:46:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:46:43,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:46:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:46:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:46:43,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:46:43,963 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:46:44,664 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:46:44,664 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:46:44,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:46:44 BoogieIcfgContainer [2019-12-27 05:46:44,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:46:44,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:46:44,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:46:44,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:46:44,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:46:43" (1/3) ... [2019-12-27 05:46:44,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c969d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:46:44, skipping insertion in model container [2019-12-27 05:46:44,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:46:43" (2/3) ... [2019-12-27 05:46:44,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c969d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:46:44, skipping insertion in model container [2019-12-27 05:46:44,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:46:44" (3/3) ... [2019-12-27 05:46:44,679 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc.i [2019-12-27 05:46:44,691 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:46:44,691 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:46:44,703 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:46:44,704 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:46:44,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,767 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,768 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,768 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,769 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,769 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,778 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,778 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,811 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,811 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,812 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,840 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,843 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:46:44,859 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 05:46:44,879 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:46:44,880 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:46:44,880 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:46:44,880 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:46:44,880 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:46:44,880 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:46:44,880 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:46:44,880 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:46:44,897 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 05:46:44,899 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 05:46:44,983 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 05:46:44,984 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:46:44,997 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 05:46:45,016 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 05:46:45,073 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 05:46:45,074 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:46:45,080 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 05:46:45,094 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 05:46:45,095 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:46:48,425 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 05:46:48,548 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55625 [2019-12-27 05:46:48,548 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 05:46:48,552 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 89 transitions [2019-12-27 05:46:49,066 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 05:46:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 05:46:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:46:49,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:49,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:46:49,077 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:49,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:49,083 INFO L82 PathProgramCache]: Analyzing trace with hash 786448, now seen corresponding path program 1 times [2019-12-27 05:46:49,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:49,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931760959] [2019-12-27 05:46:49,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:46:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:46:49,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931760959] [2019-12-27 05:46:49,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:46:49,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:46:49,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026526696] [2019-12-27 05:46:49,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:46:49,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:46:49,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:46:49,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:46:49,338 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 05:46:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:46:49,653 INFO L93 Difference]: Finished difference Result 9196 states and 29676 transitions. [2019-12-27 05:46:49,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:46:49,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:46:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:46:49,765 INFO L225 Difference]: With dead ends: 9196 [2019-12-27 05:46:49,766 INFO L226 Difference]: Without dead ends: 8650 [2019-12-27 05:46:49,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:46:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-27 05:46:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 8650. [2019-12-27 05:46:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2019-12-27 05:46:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 27866 transitions. [2019-12-27 05:46:50,318 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 27866 transitions. Word has length 3 [2019-12-27 05:46:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:46:50,318 INFO L462 AbstractCegarLoop]: Abstraction has 8650 states and 27866 transitions. [2019-12-27 05:46:50,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:46:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 27866 transitions. [2019-12-27 05:46:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:46:50,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:50,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:46:50,322 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:50,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:50,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1848805564, now seen corresponding path program 1 times [2019-12-27 05:46:50,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:50,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6805845] [2019-12-27 05:46:50,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:46:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:46:50,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6805845] [2019-12-27 05:46:50,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:46:50,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:46:50,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648330329] [2019-12-27 05:46:50,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:46:50,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:46:50,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:46:50,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:46:50,418 INFO L87 Difference]: Start difference. First operand 8650 states and 27866 transitions. Second operand 4 states. [2019-12-27 05:46:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:46:50,969 INFO L93 Difference]: Finished difference Result 13062 states and 40116 transitions. [2019-12-27 05:46:50,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:46:50,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:46:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:46:51,061 INFO L225 Difference]: With dead ends: 13062 [2019-12-27 05:46:51,061 INFO L226 Difference]: Without dead ends: 13055 [2019-12-27 05:46:51,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:46:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13055 states. [2019-12-27 05:46:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13055 to 11681. [2019-12-27 05:46:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11681 states. [2019-12-27 05:46:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 36573 transitions. [2019-12-27 05:46:52,076 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 36573 transitions. Word has length 11 [2019-12-27 05:46:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:46:52,076 INFO L462 AbstractCegarLoop]: Abstraction has 11681 states and 36573 transitions. [2019-12-27 05:46:52,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:46:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 36573 transitions. [2019-12-27 05:46:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:46:52,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:52,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:46:52,087 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1479508104, now seen corresponding path program 1 times [2019-12-27 05:46:52,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:52,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684996004] [2019-12-27 05:46:52,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:46:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:46:52,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684996004] [2019-12-27 05:46:52,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:46:52,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:46:52,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433980974] [2019-12-27 05:46:52,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:46:52,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:46:52,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:46:52,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:46:52,257 INFO L87 Difference]: Start difference. First operand 11681 states and 36573 transitions. Second operand 4 states. [2019-12-27 05:46:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:46:52,514 INFO L93 Difference]: Finished difference Result 13877 states and 43308 transitions. [2019-12-27 05:46:52,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:46:52,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 05:46:52,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:46:52,566 INFO L225 Difference]: With dead ends: 13877 [2019-12-27 05:46:52,567 INFO L226 Difference]: Without dead ends: 13877 [2019-12-27 05:46:52,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:46:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13877 states. [2019-12-27 05:46:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13877 to 12389. [2019-12-27 05:46:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12389 states. [2019-12-27 05:46:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12389 states to 12389 states and 38882 transitions. [2019-12-27 05:46:53,081 INFO L78 Accepts]: Start accepts. Automaton has 12389 states and 38882 transitions. Word has length 14 [2019-12-27 05:46:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:46:53,082 INFO L462 AbstractCegarLoop]: Abstraction has 12389 states and 38882 transitions. [2019-12-27 05:46:53,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:46:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 12389 states and 38882 transitions. [2019-12-27 05:46:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:46:53,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:53,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:46:53,086 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:53,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:53,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1357739076, now seen corresponding path program 1 times [2019-12-27 05:46:53,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:53,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343278496] [2019-12-27 05:46:53,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:46:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:46:53,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343278496] [2019-12-27 05:46:53,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:46:53,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:46:53,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629667740] [2019-12-27 05:46:53,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:46:53,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:46:53,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:46:53,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:46:53,141 INFO L87 Difference]: Start difference. First operand 12389 states and 38882 transitions. Second operand 3 states. [2019-12-27 05:46:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:46:53,219 INFO L93 Difference]: Finished difference Result 12386 states and 38873 transitions. [2019-12-27 05:46:53,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:46:53,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 05:46:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:46:53,256 INFO L225 Difference]: With dead ends: 12386 [2019-12-27 05:46:53,257 INFO L226 Difference]: Without dead ends: 12386 [2019-12-27 05:46:53,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:46:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2019-12-27 05:46:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12386. [2019-12-27 05:46:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12386 states. [2019-12-27 05:46:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 38873 transitions. [2019-12-27 05:46:53,786 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 38873 transitions. Word has length 16 [2019-12-27 05:46:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:46:53,787 INFO L462 AbstractCegarLoop]: Abstraction has 12386 states and 38873 transitions. [2019-12-27 05:46:53,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:46:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 38873 transitions. [2019-12-27 05:46:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 05:46:53,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:53,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:46:53,792 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:53,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:53,793 INFO L82 PathProgramCache]: Analyzing trace with hash 865126068, now seen corresponding path program 1 times [2019-12-27 05:46:53,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:53,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689778430] [2019-12-27 05:46:53,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:46:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:46:53,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689778430] [2019-12-27 05:46:53,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:46:53,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:46:53,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915706194] [2019-12-27 05:46:53,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:46:53,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:46:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:46:53,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:46:53,903 INFO L87 Difference]: Start difference. First operand 12386 states and 38873 transitions. Second operand 3 states. [2019-12-27 05:46:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:46:53,963 INFO L93 Difference]: Finished difference Result 11721 states and 36198 transitions. [2019-12-27 05:46:53,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:46:53,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 05:46:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:46:53,995 INFO L225 Difference]: With dead ends: 11721 [2019-12-27 05:46:53,995 INFO L226 Difference]: Without dead ends: 11721 [2019-12-27 05:46:53,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:46:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11721 states. [2019-12-27 05:46:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11721 to 11641. [2019-12-27 05:46:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11641 states. [2019-12-27 05:46:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11641 states to 11641 states and 35966 transitions. [2019-12-27 05:46:54,350 INFO L78 Accepts]: Start accepts. Automaton has 11641 states and 35966 transitions. Word has length 17 [2019-12-27 05:46:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:46:54,350 INFO L462 AbstractCegarLoop]: Abstraction has 11641 states and 35966 transitions. [2019-12-27 05:46:54,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:46:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 11641 states and 35966 transitions. [2019-12-27 05:46:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 05:46:54,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:54,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:46:54,354 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:54,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:54,355 INFO L82 PathProgramCache]: Analyzing trace with hash -843797421, now seen corresponding path program 1 times [2019-12-27 05:46:54,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:54,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857343162] [2019-12-27 05:46:54,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:46:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:46:54,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857343162] [2019-12-27 05:46:54,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:46:54,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:46:54,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612787334] [2019-12-27 05:46:54,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:46:54,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:46:54,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:46:54,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:46:54,444 INFO L87 Difference]: Start difference. First operand 11641 states and 35966 transitions. Second operand 4 states. [2019-12-27 05:46:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:46:54,484 INFO L93 Difference]: Finished difference Result 2210 states and 5498 transitions. [2019-12-27 05:46:54,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:46:54,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 05:46:54,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:46:54,490 INFO L225 Difference]: With dead ends: 2210 [2019-12-27 05:46:54,490 INFO L226 Difference]: Without dead ends: 1559 [2019-12-27 05:46:54,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:46:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2019-12-27 05:46:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2019-12-27 05:46:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2019-12-27 05:46:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 3435 transitions. [2019-12-27 05:46:54,517 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 3435 transitions. Word has length 17 [2019-12-27 05:46:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:46:54,518 INFO L462 AbstractCegarLoop]: Abstraction has 1559 states and 3435 transitions. [2019-12-27 05:46:54,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:46:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 3435 transitions. [2019-12-27 05:46:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:46:54,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:54,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:46:54,522 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:54,522 INFO L82 PathProgramCache]: Analyzing trace with hash 935036584, now seen corresponding path program 1 times [2019-12-27 05:46:54,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:54,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560955120] [2019-12-27 05:46:54,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:46:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:46:54,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560955120] [2019-12-27 05:46:54,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:46:54,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:46:54,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731639643] [2019-12-27 05:46:54,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:46:54,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:46:54,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:46:54,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:46:54,673 INFO L87 Difference]: Start difference. First operand 1559 states and 3435 transitions. Second operand 6 states. [2019-12-27 05:46:54,854 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-27 05:46:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:46:55,424 INFO L93 Difference]: Finished difference Result 4279 states and 9333 transitions. [2019-12-27 05:46:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:46:55,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 05:46:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:46:55,431 INFO L225 Difference]: With dead ends: 4279 [2019-12-27 05:46:55,431 INFO L226 Difference]: Without dead ends: 4244 [2019-12-27 05:46:55,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:46:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2019-12-27 05:46:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 1893. [2019-12-27 05:46:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-12-27 05:46:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 4248 transitions. [2019-12-27 05:46:55,484 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 4248 transitions. Word has length 25 [2019-12-27 05:46:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:46:55,484 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 4248 transitions. [2019-12-27 05:46:55,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:46:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 4248 transitions. [2019-12-27 05:46:55,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 05:46:55,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:55,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:46:55,488 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:55,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:55,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1584123616, now seen corresponding path program 1 times [2019-12-27 05:46:55,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:55,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541369330] [2019-12-27 05:46:55,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:46:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:46:55,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541369330] [2019-12-27 05:46:55,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:46:55,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:46:55,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649819927] [2019-12-27 05:46:55,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:46:55,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:46:55,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:46:55,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:46:55,562 INFO L87 Difference]: Start difference. First operand 1893 states and 4248 transitions. Second operand 6 states. [2019-12-27 05:46:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:46:56,238 INFO L93 Difference]: Finished difference Result 3982 states and 8624 transitions. [2019-12-27 05:46:56,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:46:56,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 05:46:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:46:56,244 INFO L225 Difference]: With dead ends: 3982 [2019-12-27 05:46:56,244 INFO L226 Difference]: Without dead ends: 3953 [2019-12-27 05:46:56,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:46:56,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3953 states. [2019-12-27 05:46:56,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3953 to 1860. [2019-12-27 05:46:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2019-12-27 05:46:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 4196 transitions. [2019-12-27 05:46:56,292 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 4196 transitions. Word has length 26 [2019-12-27 05:46:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:46:56,293 INFO L462 AbstractCegarLoop]: Abstraction has 1860 states and 4196 transitions. [2019-12-27 05:46:56,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:46:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 4196 transitions. [2019-12-27 05:46:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:46:56,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:56,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:46:56,296 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:56,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:56,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1884987326, now seen corresponding path program 1 times [2019-12-27 05:46:56,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:56,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080515387] [2019-12-27 05:46:56,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:46:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:46:56,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080515387] [2019-12-27 05:46:56,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:46:56,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:46:56,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442962479] [2019-12-27 05:46:56,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:46:56,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:46:56,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:46:56,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:46:56,361 INFO L87 Difference]: Start difference. First operand 1860 states and 4196 transitions. Second operand 3 states. [2019-12-27 05:46:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:46:56,378 INFO L93 Difference]: Finished difference Result 3366 states and 7600 transitions. [2019-12-27 05:46:56,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:46:56,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 05:46:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:46:56,382 INFO L225 Difference]: With dead ends: 3366 [2019-12-27 05:46:56,382 INFO L226 Difference]: Without dead ends: 1785 [2019-12-27 05:46:56,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:46:56,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2019-12-27 05:46:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1757. [2019-12-27 05:46:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1757 states. [2019-12-27 05:46:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 3881 transitions. [2019-12-27 05:46:56,412 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 3881 transitions. Word has length 27 [2019-12-27 05:46:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:46:56,413 INFO L462 AbstractCegarLoop]: Abstraction has 1757 states and 3881 transitions. [2019-12-27 05:46:56,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:46:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3881 transitions. [2019-12-27 05:46:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:46:56,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:56,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:46:56,416 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:56,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:56,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1012801820, now seen corresponding path program 1 times [2019-12-27 05:46:56,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:56,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753187845] [2019-12-27 05:46:56,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:46:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:46:56,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753187845] [2019-12-27 05:46:56,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:46:56,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:46:56,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097268569] [2019-12-27 05:46:56,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:46:56,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:46:56,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:46:56,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:46:56,528 INFO L87 Difference]: Start difference. First operand 1757 states and 3881 transitions. Second operand 5 states. [2019-12-27 05:46:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:46:56,572 INFO L93 Difference]: Finished difference Result 903 states and 1952 transitions. [2019-12-27 05:46:56,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:46:56,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 05:46:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:46:56,574 INFO L225 Difference]: With dead ends: 903 [2019-12-27 05:46:56,574 INFO L226 Difference]: Without dead ends: 733 [2019-12-27 05:46:56,574 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-27 05:46:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-12-27 05:46:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2019-12-27 05:46:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-12-27 05:46:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1633 transitions. [2019-12-27 05:46:56,585 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1633 transitions. Word has length 28 [2019-12-27 05:46:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:46:56,586 INFO L462 AbstractCegarLoop]: Abstraction has 733 states and 1633 transitions. [2019-12-27 05:46:56,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:46:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1633 transitions. [2019-12-27 05:46:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:46:56,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:56,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:46:56,589 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:56,589 INFO L82 PathProgramCache]: Analyzing trace with hash -646981299, now seen corresponding path program 1 times [2019-12-27 05:46:56,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:56,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622980199] [2019-12-27 05:46:56,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:46:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:46:56,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622980199] [2019-12-27 05:46:56,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:46:56,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:46:56,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205095391] [2019-12-27 05:46:56,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:46:56,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:46:56,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:46:56,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:46:56,690 INFO L87 Difference]: Start difference. First operand 733 states and 1633 transitions. Second operand 7 states. [2019-12-27 05:46:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:46:56,881 INFO L93 Difference]: Finished difference Result 1463 states and 3172 transitions. [2019-12-27 05:46:56,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:46:56,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 05:46:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:46:56,883 INFO L225 Difference]: With dead ends: 1463 [2019-12-27 05:46:56,883 INFO L226 Difference]: Without dead ends: 978 [2019-12-27 05:46:56,883 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-27 05:46:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-12-27 05:46:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 807. [2019-12-27 05:46:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-12-27 05:46:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1757 transitions. [2019-12-27 05:46:56,898 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1757 transitions. Word has length 52 [2019-12-27 05:46:56,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:46:56,898 INFO L462 AbstractCegarLoop]: Abstraction has 807 states and 1757 transitions. [2019-12-27 05:46:56,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:46:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1757 transitions. [2019-12-27 05:46:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:46:56,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:56,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:46:56,901 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:56,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:56,902 INFO L82 PathProgramCache]: Analyzing trace with hash -643986163, now seen corresponding path program 2 times [2019-12-27 05:46:56,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:56,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156632675] [2019-12-27 05:46:56,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:46:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:46:56,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156632675] [2019-12-27 05:46:56,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:46:56,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:46:56,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683810334] [2019-12-27 05:46:56,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:46:56,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:46:56,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:46:56,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:46:56,972 INFO L87 Difference]: Start difference. First operand 807 states and 1757 transitions. Second operand 3 states. [2019-12-27 05:46:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:46:57,026 INFO L93 Difference]: Finished difference Result 1023 states and 2206 transitions. [2019-12-27 05:46:57,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:46:57,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 05:46:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:46:57,028 INFO L225 Difference]: With dead ends: 1023 [2019-12-27 05:46:57,029 INFO L226 Difference]: Without dead ends: 1023 [2019-12-27 05:46:57,030 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-27 05:46:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-12-27 05:46:57,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 721. [2019-12-27 05:46:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-12-27 05:46:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1553 transitions. [2019-12-27 05:46:57,043 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1553 transitions. Word has length 52 [2019-12-27 05:46:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:46:57,044 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 1553 transitions. [2019-12-27 05:46:57,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:46:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1553 transitions. [2019-12-27 05:46:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 05:46:57,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:46:57,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:46:57,046 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:46:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:46:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash -87902062, now seen corresponding path program 1 times [2019-12-27 05:46:57,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:46:57,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445897959] [2019-12-27 05:46:57,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:46:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:46:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:46:57,434 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:46:57,434 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:46:57,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t585~0.base_22| 1)) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~__unbuffered_cnt~0_13) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~y$r_buff1_thd2~0_53) (= 0 v_~y$r_buff1_thd0~0_22) (= 0 v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd0~0_24 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t585~0.base_22|) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~y$flush_delayed~0_14) (= v_~y$read_delayed~0_6 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t585~0.base_22| 4)) (= v_~y$mem_tmp~0_11 0) (= v_~x~0_17 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t585~0.base_22|) 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= |v_ULTIMATE.start_main_~#t585~0.offset_17| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t585~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t585~0.base_22|) |v_ULTIMATE.start_main_~#t585~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard1~0_15 0) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1_used~0_67 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ULTIMATE.start_main_~#t585~0.base=|v_ULTIMATE.start_main_~#t585~0.base_22|, #length=|v_#length_17|, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_18|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_15|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_24, ULTIMATE.start_main_~#t585~0.offset=|v_ULTIMATE.start_main_~#t585~0.offset_17|, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} 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, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t585~0.base, #length, ~y~0, ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t585~0.offset, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:46:57,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L797-1-->L799: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t586~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t586~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t586~0.base_12|) (= |v_ULTIMATE.start_main_~#t586~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12|) |v_ULTIMATE.start_main_~#t586~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_12|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 05:46:57,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_11) (= 1 v_~x~0_5) (= v_~y$r_buff0_thd2~0_55 v_~y$r_buff1_thd2~0_33) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd1~0_16 1) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 05:46:57,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-924998831 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-924998831 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-924998831| ~y$w_buff0_used~0_In-924998831) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-924998831|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-924998831, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-924998831} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-924998831|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-924998831, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-924998831} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 05:46:57,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-112326392 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-112326392 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-112326392 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-112326392 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-112326392| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-112326392 |P0Thread1of1ForFork0_#t~ite6_Out-112326392|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-112326392, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-112326392, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-112326392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-112326392} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-112326392|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-112326392, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-112326392, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-112326392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-112326392} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 05:46:57,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-829970689 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-829970689 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-829970689 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out-829970689 ~y$r_buff0_thd1~0_In-829970689) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-829970689, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-829970689} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-829970689, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-829970689|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-829970689} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:46:57,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1609714286 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out1609714286| ~y$w_buff0~0_In1609714286) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1609714286 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1609714286 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1609714286 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1609714286 256))))) (= |P1Thread1of1ForFork1_#t~ite14_Out1609714286| |P1Thread1of1ForFork1_#t~ite15_Out1609714286|)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out1609714286| ~y$w_buff0~0_In1609714286) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1609714286| |P1Thread1of1ForFork1_#t~ite14_Out1609714286|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1609714286, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1609714286, ~y$w_buff0~0=~y$w_buff0~0_In1609714286, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1609714286, ~weak$$choice2~0=~weak$$choice2~0_In1609714286, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1609714286|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1609714286} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1609714286, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1609714286, ~y$w_buff0~0=~y$w_buff0~0_In1609714286, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1609714286, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1609714286|, ~weak$$choice2~0=~weak$$choice2~0_In1609714286, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1609714286|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1609714286} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 05:46:57,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In793875424 256)))) (or (and (= ~y$w_buff1~0_In793875424 |P1Thread1of1ForFork1_#t~ite17_Out793875424|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In793875424 256)))) (or (and (= (mod ~y$w_buff1_used~0_In793875424 256) 0) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In793875424 256)) .cse0) (= (mod ~y$w_buff0_used~0_In793875424 256) 0))) (= |P1Thread1of1ForFork1_#t~ite18_Out793875424| |P1Thread1of1ForFork1_#t~ite17_Out793875424|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite17_In793875424| |P1Thread1of1ForFork1_#t~ite17_Out793875424|) (= |P1Thread1of1ForFork1_#t~ite18_Out793875424| ~y$w_buff1~0_In793875424) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In793875424, ~y$w_buff1~0=~y$w_buff1~0_In793875424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In793875424, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In793875424, ~weak$$choice2~0=~weak$$choice2~0_In793875424, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In793875424|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In793875424} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In793875424, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out793875424|, ~y$w_buff1~0=~y$w_buff1~0_In793875424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In793875424, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In793875424, ~weak$$choice2~0=~weak$$choice2~0_In793875424, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out793875424|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In793875424} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 05:46:57,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-892787770 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out-892787770| ~y$w_buff0_used~0_In-892787770) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-892787770 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-892787770 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-892787770 256)) .cse0) (and .cse0 (= (mod ~y$w_buff1_used~0_In-892787770 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out-892787770| |P1Thread1of1ForFork1_#t~ite21_Out-892787770|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-892787770| ~y$w_buff0_used~0_In-892787770) (= |P1Thread1of1ForFork1_#t~ite20_In-892787770| |P1Thread1of1ForFork1_#t~ite20_Out-892787770|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-892787770, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-892787770, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-892787770|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-892787770, ~weak$$choice2~0=~weak$$choice2~0_In-892787770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-892787770} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-892787770, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-892787770, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-892787770|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-892787770, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-892787770|, ~weak$$choice2~0=~weak$$choice2~0_In-892787770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-892787770} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 05:46:57,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_61 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 05:46:57,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1199044273 256)))) (or (and (not .cse0) (= ~y$r_buff1_thd2~0_In-1199044273 |P1Thread1of1ForFork1_#t~ite30_Out-1199044273|) (= |P1Thread1of1ForFork1_#t~ite29_In-1199044273| |P1Thread1of1ForFork1_#t~ite29_Out-1199044273|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1199044273 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1199044273 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1199044273 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1199044273 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1199044273| ~y$r_buff1_thd2~0_In-1199044273) (= |P1Thread1of1ForFork1_#t~ite29_Out-1199044273| |P1Thread1of1ForFork1_#t~ite30_Out-1199044273|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1199044273, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1199044273|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1199044273, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1199044273, ~weak$$choice2~0=~weak$$choice2~0_In-1199044273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1199044273} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1199044273, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1199044273|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1199044273|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1199044273, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1199044273, ~weak$$choice2~0=~weak$$choice2~0_In-1199044273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1199044273} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 05:46:57,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-2037232217 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2037232217 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2037232217 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-2037232217 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-2037232217| ~y$r_buff1_thd1~0_In-2037232217) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-2037232217|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2037232217, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2037232217, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2037232217, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2037232217} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2037232217, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2037232217, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2037232217|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2037232217, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2037232217} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 05:46:57,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L742-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} 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-27 05:46:57,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_15 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 05:46:57,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-162744933 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-162744933 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-162744933| ~y$w_buff1~0_In-162744933) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-162744933 |P1Thread1of1ForFork1_#t~ite32_Out-162744933|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-162744933, ~y$w_buff1~0=~y$w_buff1~0_In-162744933, ~y~0=~y~0_In-162744933, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-162744933} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-162744933, ~y$w_buff1~0=~y$w_buff1~0_In-162744933, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-162744933|, ~y~0=~y~0_In-162744933, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-162744933} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 05:46:57,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 05:46:57,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1432005984 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1432005984 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1432005984| ~y$w_buff0_used~0_In1432005984)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1432005984| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1432005984, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1432005984} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1432005984, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1432005984, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1432005984|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 05:46:57,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1563074950 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1563074950 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1563074950 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1563074950 256) 0))) (or (and (= ~y$w_buff1_used~0_In1563074950 |P1Thread1of1ForFork1_#t~ite35_Out1563074950|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1563074950|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563074950, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563074950, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563074950, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563074950} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563074950, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563074950, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563074950, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1563074950|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563074950} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 05:46:57,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2100531538 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2100531538 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-2100531538| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-2100531538| ~y$r_buff0_thd2~0_In-2100531538)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2100531538, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2100531538} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2100531538, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2100531538, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2100531538|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 05:46:57,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-60853212 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-60853212 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-60853212 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-60853212 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-60853212| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In-60853212 |P1Thread1of1ForFork1_#t~ite37_Out-60853212|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-60853212, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-60853212, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-60853212, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-60853212} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-60853212, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-60853212, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-60853212, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-60853212|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-60853212} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 05:46:57,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} 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-27 05:46:57,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_82 256)) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 05:46:57,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-773868212 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-773868212 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-773868212| ~y$w_buff1~0_In-773868212)) (and (= ~y~0_In-773868212 |ULTIMATE.start_main_#t~ite40_Out-773868212|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-773868212, ~y~0=~y~0_In-773868212, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-773868212, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-773868212} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-773868212|, ~y$w_buff1~0=~y$w_buff1~0_In-773868212, ~y~0=~y~0_In-773868212, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-773868212, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-773868212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 05:46:57,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 05:46:57,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In439247561 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In439247561 256) 0))) (or (and (= ~y$w_buff0_used~0_In439247561 |ULTIMATE.start_main_#t~ite42_Out439247561|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out439247561|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In439247561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In439247561} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In439247561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In439247561, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out439247561|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 05:46:57,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-723450394 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-723450394 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-723450394 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-723450394 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-723450394 |ULTIMATE.start_main_#t~ite43_Out-723450394|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-723450394|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-723450394, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-723450394, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-723450394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-723450394} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-723450394, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-723450394, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-723450394|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-723450394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-723450394} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 05:46:57,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-58202726 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-58202726 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-58202726| ~y$r_buff0_thd0~0_In-58202726)) (and (= |ULTIMATE.start_main_#t~ite44_Out-58202726| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-58202726, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-58202726} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-58202726, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-58202726, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-58202726|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 05:46:57,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2132960239 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In2132960239 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2132960239 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2132960239 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out2132960239| ~y$r_buff1_thd0~0_In2132960239)) (and (= |ULTIMATE.start_main_#t~ite45_Out2132960239| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2132960239, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2132960239, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2132960239, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2132960239} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2132960239, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2132960239, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2132960239, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2132960239|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2132960239} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 05:46:57,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_10| v_~y$r_buff1_thd0~0_14) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 2 v_~x~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~x~0=v_~x~0_9, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} 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-27 05:46:57,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:46:57 BasicIcfg [2019-12-27 05:46:57,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:46:57,573 INFO L168 Benchmark]: Toolchain (without parser) took 14537.60 ms. Allocated memory was 145.2 MB in the beginning and 638.6 MB in the end (delta: 493.4 MB). Free memory was 100.9 MB in the beginning and 564.1 MB in the end (delta: -463.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. [2019-12-27 05:46:57,574 INFO L168 Benchmark]: CDTParser took 0.96 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 05:46:57,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.20 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.7 MB in the beginning and 158.2 MB in the end (delta: -57.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:46:57,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.33 ms. Allocated memory is still 203.9 MB. Free memory was 158.2 MB in the beginning and 155.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:46:57,581 INFO L168 Benchmark]: Boogie Preprocessor took 37.35 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 153.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:46:57,582 INFO L168 Benchmark]: RCFGBuilder took 781.93 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 109.2 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 05:46:57,583 INFO L168 Benchmark]: TraceAbstraction took 12900.23 ms. Allocated memory was 203.9 MB in the beginning and 638.6 MB in the end (delta: 434.6 MB). Free memory was 109.2 MB in the beginning and 564.1 MB in the end (delta: -454.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 05:46:57,587 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.96 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.20 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.7 MB in the beginning and 158.2 MB in the end (delta: -57.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.33 ms. Allocated memory is still 203.9 MB. Free memory was 158.2 MB in the beginning and 155.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.35 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 153.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.93 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 109.2 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12900.23 ms. Allocated memory was 203.9 MB in the beginning and 638.6 MB in the end (delta: 434.6 MB). Free memory was 109.2 MB in the beginning and 564.1 MB in the end (delta: -454.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 27 ChoiceCompositions, 4371 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55625 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [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 [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1447 SDtfs, 1583 SDslu, 2340 SDs, 0 SdLazy, 1197 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12389occurred 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: 3.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 7887 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 23814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...