/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:29:28,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:29:28,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:29:28,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:29:28,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:29:28,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:29:28,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:29:28,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:29:28,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:29:28,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:29:28,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:29:28,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:29:28,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:29:28,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:29:28,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:29:28,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:29:28,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:29:28,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:29:28,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:29:28,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:29:28,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:29:28,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:29:28,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:29:28,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:29:28,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:29:28,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:29:28,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:29:28,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:29:28,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:29:28,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:29:28,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:29:28,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:29:28,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:29:28,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:29:28,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:29:28,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:29:28,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:29:28,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:29:28,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:29:28,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:29:28,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:29:28,768 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-SemanticLbe-MCR.epf [2019-12-27 16:29:28,783 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:29:28,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:29:28,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:29:28,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:29:28,785 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:29:28,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:29:28,785 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:29:28,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:29:28,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:29:28,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:29:28,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:29:28,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:29:28,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:29:28,786 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:29:28,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:29:28,787 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:29:28,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:29:28,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:29:28,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:29:28,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:29:28,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:29:28,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:29:28,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:29:28,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:29:28,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:29:28,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:29:28,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:29:28,789 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:29:28,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:29:28,789 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:29:28,790 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:29:29,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:29:29,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:29:29,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:29:29,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:29:29,100 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:29:29,101 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_rmo.opt.i [2019-12-27 16:29:29,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf8e5af21/5163e691b558464ab58b1733eeeff27b/FLAGc1ec08142 [2019-12-27 16:29:29,745 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:29:29,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_rmo.opt.i [2019-12-27 16:29:29,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf8e5af21/5163e691b558464ab58b1733eeeff27b/FLAGc1ec08142 [2019-12-27 16:29:29,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf8e5af21/5163e691b558464ab58b1733eeeff27b [2019-12-27 16:29:30,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:29:30,004 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:29:30,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:29:30,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:29:30,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:29:30,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:29:29" (1/1) ... [2019-12-27 16:29:30,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8a1a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30, skipping insertion in model container [2019-12-27 16:29:30,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:29:29" (1/1) ... [2019-12-27 16:29:30,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:29:30,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:29:30,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:29:30,677 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:29:30,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:29:30,835 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:29:30,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30 WrapperNode [2019-12-27 16:29:30,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:29:30,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:29:30,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:29:30,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:29:30,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30" (1/1) ... [2019-12-27 16:29:30,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30" (1/1) ... [2019-12-27 16:29:30,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:29:30,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:29:30,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:29:30,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:29:30,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30" (1/1) ... [2019-12-27 16:29:30,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30" (1/1) ... [2019-12-27 16:29:30,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30" (1/1) ... [2019-12-27 16:29:30,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30" (1/1) ... [2019-12-27 16:29:30,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30" (1/1) ... [2019-12-27 16:29:30,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30" (1/1) ... [2019-12-27 16:29:30,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30" (1/1) ... [2019-12-27 16:29:30,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:29:30,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:29:30,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:29:30,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:29:30,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30" (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 16:29:31,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:29:31,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:29:31,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:29:31,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:29:31,009 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:29:31,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:29:31,009 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:29:31,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:29:31,009 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:29:31,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:29:31,010 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 16:29:31,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 16:29:31,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:29:31,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:29:31,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:29:31,012 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 16:29:31,784 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:29:31,785 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:29:31,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:29:31 BoogieIcfgContainer [2019-12-27 16:29:31,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:29:31,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:29:31,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:29:31,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:29:31,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:29:29" (1/3) ... [2019-12-27 16:29:31,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b6a586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:29:31, skipping insertion in model container [2019-12-27 16:29:31,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:29:30" (2/3) ... [2019-12-27 16:29:31,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b6a586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:29:31, skipping insertion in model container [2019-12-27 16:29:31,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:29:31" (3/3) ... [2019-12-27 16:29:31,795 INFO L109 eAbstractionObserver]: Analyzing ICFG mix026_rmo.opt.i [2019-12-27 16:29:31,805 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:29:31,805 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:29:31,812 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:29:31,813 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:29:31,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,855 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,856 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,858 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,859 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,899 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,899 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,899 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,900 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,900 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,906 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,907 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,907 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,907 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,907 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,907 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,916 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,917 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,921 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,928 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,932 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,933 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,933 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:29:31,949 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 16:29:31,969 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:29:31,969 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:29:31,970 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:29:31,970 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:29:31,970 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:29:31,970 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:29:31,970 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:29:31,970 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:29:31,987 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 16:29:31,990 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 16:29:32,092 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 16:29:32,092 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:29:32,109 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 16:29:32,136 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 16:29:32,194 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 16:29:32,194 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:29:32,204 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 16:29:32,227 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 16:29:32,228 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:29:37,837 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-12-27 16:29:38,727 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 16:29:38,863 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 16:29:38,897 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66604 [2019-12-27 16:29:38,898 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 16:29:38,902 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 87 places, 92 transitions [2019-12-27 16:30:10,680 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 154566 states. [2019-12-27 16:30:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 154566 states. [2019-12-27 16:30:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 16:30:10,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:30:10,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:30:10,690 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:30:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:30:10,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1218656403, now seen corresponding path program 1 times [2019-12-27 16:30:10,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:30:10,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272019733] [2019-12-27 16:30:10,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:30:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:30:10,992 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 16:30:10,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272019733] [2019-12-27 16:30:10,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:30:10,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:30:10,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [826038020] [2019-12-27 16:30:10,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:30:11,002 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:30:11,016 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 16:30:11,016 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:30:11,020 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:30:11,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:30:11,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:30:11,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:30:11,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:30:11,038 INFO L87 Difference]: Start difference. First operand 154566 states. Second operand 3 states. [2019-12-27 16:30:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:30:12,868 INFO L93 Difference]: Finished difference Result 152486 states and 727020 transitions. [2019-12-27 16:30:12,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:30:12,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 16:30:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:30:18,223 INFO L225 Difference]: With dead ends: 152486 [2019-12-27 16:30:18,224 INFO L226 Difference]: Without dead ends: 143750 [2019-12-27 16:30:18,225 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 16:30:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143750 states. [2019-12-27 16:30:26,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143750 to 143750. [2019-12-27 16:30:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143750 states. [2019-12-27 16:30:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143750 states to 143750 states and 684484 transitions. [2019-12-27 16:30:35,010 INFO L78 Accepts]: Start accepts. Automaton has 143750 states and 684484 transitions. Word has length 7 [2019-12-27 16:30:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:30:35,011 INFO L462 AbstractCegarLoop]: Abstraction has 143750 states and 684484 transitions. [2019-12-27 16:30:35,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:30:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 143750 states and 684484 transitions. [2019-12-27 16:30:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:30:35,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:30:35,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:30:35,028 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:30:35,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:30:35,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1478379087, now seen corresponding path program 1 times [2019-12-27 16:30:35,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:30:35,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715115847] [2019-12-27 16:30:35,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:30:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:30:35,159 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 16:30:35,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715115847] [2019-12-27 16:30:35,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:30:35,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:30:35,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [237496188] [2019-12-27 16:30:35,161 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:30:35,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:30:35,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:30:35,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:30:35,170 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:30:35,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:30:35,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:30:35,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:30:35,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:30:35,173 INFO L87 Difference]: Start difference. First operand 143750 states and 684484 transitions. Second operand 4 states. [2019-12-27 16:30:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:30:43,411 INFO L93 Difference]: Finished difference Result 226574 states and 1038112 transitions. [2019-12-27 16:30:43,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:30:43,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 16:30:43,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:30:44,277 INFO L225 Difference]: With dead ends: 226574 [2019-12-27 16:30:44,278 INFO L226 Difference]: Without dead ends: 226406 [2019-12-27 16:30:44,278 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 16:30:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226406 states. [2019-12-27 16:30:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226406 to 210054. [2019-12-27 16:30:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210054 states. [2019-12-27 16:30:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210054 states to 210054 states and 970358 transitions. [2019-12-27 16:30:56,693 INFO L78 Accepts]: Start accepts. Automaton has 210054 states and 970358 transitions. Word has length 15 [2019-12-27 16:30:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:30:56,694 INFO L462 AbstractCegarLoop]: Abstraction has 210054 states and 970358 transitions. [2019-12-27 16:30:56,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:30:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 210054 states and 970358 transitions. [2019-12-27 16:30:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:30:56,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:30:56,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:30:56,699 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:30:56,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:30:56,699 INFO L82 PathProgramCache]: Analyzing trace with hash -731927730, now seen corresponding path program 1 times [2019-12-27 16:30:56,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:30:56,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138264236] [2019-12-27 16:30:56,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:30:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:30:56,764 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 16:30:56,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138264236] [2019-12-27 16:30:56,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:30:56,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:30:56,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [593689853] [2019-12-27 16:30:56,766 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:30:56,767 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:30:56,772 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:30:56,773 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:30:56,773 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:30:56,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:30:56,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:30:56,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:30:56,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:30:56,774 INFO L87 Difference]: Start difference. First operand 210054 states and 970358 transitions. Second operand 3 states. [2019-12-27 16:31:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:04,908 INFO L93 Difference]: Finished difference Result 131238 states and 546355 transitions. [2019-12-27 16:31:04,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:31:04,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 16:31:04,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:05,428 INFO L225 Difference]: With dead ends: 131238 [2019-12-27 16:31:05,428 INFO L226 Difference]: Without dead ends: 131238 [2019-12-27 16:31:05,429 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 16:31:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131238 states. [2019-12-27 16:31:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131238 to 131238. [2019-12-27 16:31:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131238 states. [2019-12-27 16:31:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131238 states to 131238 states and 546355 transitions. [2019-12-27 16:31:11,121 INFO L78 Accepts]: Start accepts. Automaton has 131238 states and 546355 transitions. Word has length 15 [2019-12-27 16:31:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:11,121 INFO L462 AbstractCegarLoop]: Abstraction has 131238 states and 546355 transitions. [2019-12-27 16:31:11,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:31:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 131238 states and 546355 transitions. [2019-12-27 16:31:11,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:31:11,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:11,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:11,126 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:11,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:11,127 INFO L82 PathProgramCache]: Analyzing trace with hash 437045286, now seen corresponding path program 1 times [2019-12-27 16:31:11,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:11,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874911046] [2019-12-27 16:31:11,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:31:12,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874911046] [2019-12-27 16:31:12,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:12,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:31:12,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [521073378] [2019-12-27 16:31:12,180 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:12,182 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:12,184 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 16:31:12,184 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:12,186 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:31:12,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:31:12,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:12,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:31:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:31:12,187 INFO L87 Difference]: Start difference. First operand 131238 states and 546355 transitions. Second operand 4 states. [2019-12-27 16:31:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:12,379 INFO L93 Difference]: Finished difference Result 35878 states and 126762 transitions. [2019-12-27 16:31:12,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:31:12,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:31:12,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:12,449 INFO L225 Difference]: With dead ends: 35878 [2019-12-27 16:31:12,449 INFO L226 Difference]: Without dead ends: 35878 [2019-12-27 16:31:12,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:31:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35878 states. [2019-12-27 16:31:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35878 to 35878. [2019-12-27 16:31:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35878 states. [2019-12-27 16:31:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35878 states to 35878 states and 126762 transitions. [2019-12-27 16:31:13,095 INFO L78 Accepts]: Start accepts. Automaton has 35878 states and 126762 transitions. Word has length 16 [2019-12-27 16:31:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:13,096 INFO L462 AbstractCegarLoop]: Abstraction has 35878 states and 126762 transitions. [2019-12-27 16:31:13,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:31:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 35878 states and 126762 transitions. [2019-12-27 16:31:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:31:13,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:13,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:13,098 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:13,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:13,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1917193142, now seen corresponding path program 1 times [2019-12-27 16:31:13,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:13,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654537151] [2019-12-27 16:31:13,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:13,227 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 16:31:13,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654537151] [2019-12-27 16:31:13,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:13,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:31:13,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410570785] [2019-12-27 16:31:13,229 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:13,232 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:13,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 16:31:13,239 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:13,318 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:31:13,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:31:13,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:13,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:31:13,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:31:13,320 INFO L87 Difference]: Start difference. First operand 35878 states and 126762 transitions. Second operand 7 states. [2019-12-27 16:31:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:14,047 INFO L93 Difference]: Finished difference Result 51872 states and 179890 transitions. [2019-12-27 16:31:14,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:31:14,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 16:31:14,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:14,155 INFO L225 Difference]: With dead ends: 51872 [2019-12-27 16:31:14,156 INFO L226 Difference]: Without dead ends: 51856 [2019-12-27 16:31:14,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:31:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51856 states. [2019-12-27 16:31:15,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51856 to 40170. [2019-12-27 16:31:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40170 states. [2019-12-27 16:31:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40170 states to 40170 states and 141309 transitions. [2019-12-27 16:31:15,208 INFO L78 Accepts]: Start accepts. Automaton has 40170 states and 141309 transitions. Word has length 16 [2019-12-27 16:31:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:15,209 INFO L462 AbstractCegarLoop]: Abstraction has 40170 states and 141309 transitions. [2019-12-27 16:31:15,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:31:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 40170 states and 141309 transitions. [2019-12-27 16:31:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:31:15,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:15,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:15,226 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:15,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:15,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1134773804, now seen corresponding path program 1 times [2019-12-27 16:31:15,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:15,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004681749] [2019-12-27 16:31:15,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:15,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 16:31:15,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004681749] [2019-12-27 16:31:15,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:15,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:31:15,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [426590263] [2019-12-27 16:31:15,360 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:15,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:15,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 114 transitions. [2019-12-27 16:31:15,381 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:15,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:31:15,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:31:15,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:15,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:31:15,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:31:15,433 INFO L87 Difference]: Start difference. First operand 40170 states and 141309 transitions. Second operand 8 states. [2019-12-27 16:31:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:16,600 INFO L93 Difference]: Finished difference Result 61953 states and 212351 transitions. [2019-12-27 16:31:16,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:31:16,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 16:31:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:16,724 INFO L225 Difference]: With dead ends: 61953 [2019-12-27 16:31:16,725 INFO L226 Difference]: Without dead ends: 61925 [2019-12-27 16:31:16,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:31:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61925 states. [2019-12-27 16:31:17,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61925 to 41940. [2019-12-27 16:31:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41940 states. [2019-12-27 16:31:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41940 states to 41940 states and 146496 transitions. [2019-12-27 16:31:17,932 INFO L78 Accepts]: Start accepts. Automaton has 41940 states and 146496 transitions. Word has length 24 [2019-12-27 16:31:17,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:17,933 INFO L462 AbstractCegarLoop]: Abstraction has 41940 states and 146496 transitions. [2019-12-27 16:31:17,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:31:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 41940 states and 146496 transitions. [2019-12-27 16:31:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:31:17,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:17,957 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 16:31:17,957 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:17,957 INFO L82 PathProgramCache]: Analyzing trace with hash 324599252, now seen corresponding path program 1 times [2019-12-27 16:31:17,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:17,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345610017] [2019-12-27 16:31:17,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:18,028 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 16:31:18,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345610017] [2019-12-27 16:31:18,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:18,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:31:18,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1745308799] [2019-12-27 16:31:18,029 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:18,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:18,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 16:31:18,041 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:18,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:31:18,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:31:18,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:18,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:31:18,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:31:18,042 INFO L87 Difference]: Start difference. First operand 41940 states and 146496 transitions. Second operand 5 states. [2019-12-27 16:31:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:18,158 INFO L93 Difference]: Finished difference Result 21549 states and 76131 transitions. [2019-12-27 16:31:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:31:18,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:31:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:18,197 INFO L225 Difference]: With dead ends: 21549 [2019-12-27 16:31:18,197 INFO L226 Difference]: Without dead ends: 21549 [2019-12-27 16:31:18,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:31:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21549 states. [2019-12-27 16:31:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21549 to 21357. [2019-12-27 16:31:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21357 states. [2019-12-27 16:31:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21357 states to 21357 states and 75475 transitions. [2019-12-27 16:31:18,869 INFO L78 Accepts]: Start accepts. Automaton has 21357 states and 75475 transitions. Word has length 28 [2019-12-27 16:31:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:18,870 INFO L462 AbstractCegarLoop]: Abstraction has 21357 states and 75475 transitions. [2019-12-27 16:31:18,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:31:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21357 states and 75475 transitions. [2019-12-27 16:31:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:31:18,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:18,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:18,906 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:18,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash 261118904, now seen corresponding path program 1 times [2019-12-27 16:31:18,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:18,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202949473] [2019-12-27 16:31:18,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:18,988 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 16:31:18,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202949473] [2019-12-27 16:31:18,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:18,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:31:18,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [896240352] [2019-12-27 16:31:18,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:18,999 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:19,055 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 204 transitions. [2019-12-27 16:31:19,055 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:19,071 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:31:19,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:31:19,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:19,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:31:19,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:31:19,072 INFO L87 Difference]: Start difference. First operand 21357 states and 75475 transitions. Second operand 7 states. [2019-12-27 16:31:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:19,225 INFO L93 Difference]: Finished difference Result 20070 states and 72184 transitions. [2019-12-27 16:31:19,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:31:19,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 16:31:19,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:19,274 INFO L225 Difference]: With dead ends: 20070 [2019-12-27 16:31:19,275 INFO L226 Difference]: Without dead ends: 20070 [2019-12-27 16:31:19,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:31:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20070 states. [2019-12-27 16:31:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20070 to 19446. [2019-12-27 16:31:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19446 states. [2019-12-27 16:31:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19446 states to 19446 states and 70120 transitions. [2019-12-27 16:31:19,616 INFO L78 Accepts]: Start accepts. Automaton has 19446 states and 70120 transitions. Word has length 42 [2019-12-27 16:31:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:19,616 INFO L462 AbstractCegarLoop]: Abstraction has 19446 states and 70120 transitions. [2019-12-27 16:31:19,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:31:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 19446 states and 70120 transitions. [2019-12-27 16:31:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:31:19,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:19,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:19,652 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:19,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:19,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2124071368, now seen corresponding path program 1 times [2019-12-27 16:31:19,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:19,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669834337] [2019-12-27 16:31:19,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:19,712 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 16:31:19,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669834337] [2019-12-27 16:31:19,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:19,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:31:19,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [52784240] [2019-12-27 16:31:19,716 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:19,734 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:19,979 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 379 transitions. [2019-12-27 16:31:19,980 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:20,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:31:20,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:31:20,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:20,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:31:20,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:31:20,003 INFO L87 Difference]: Start difference. First operand 19446 states and 70120 transitions. Second operand 4 states. [2019-12-27 16:31:20,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:20,400 INFO L93 Difference]: Finished difference Result 28624 states and 103119 transitions. [2019-12-27 16:31:20,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:31:20,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-27 16:31:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:20,464 INFO L225 Difference]: With dead ends: 28624 [2019-12-27 16:31:20,464 INFO L226 Difference]: Without dead ends: 28624 [2019-12-27 16:31:20,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:31:20,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28624 states. [2019-12-27 16:31:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28624 to 22286. [2019-12-27 16:31:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22286 states. [2019-12-27 16:31:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22286 states to 22286 states and 80860 transitions. [2019-12-27 16:31:20,923 INFO L78 Accepts]: Start accepts. Automaton has 22286 states and 80860 transitions. Word has length 56 [2019-12-27 16:31:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:20,923 INFO L462 AbstractCegarLoop]: Abstraction has 22286 states and 80860 transitions. [2019-12-27 16:31:20,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:31:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 22286 states and 80860 transitions. [2019-12-27 16:31:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:31:20,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:20,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:20,959 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:20,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:20,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1367478236, now seen corresponding path program 1 times [2019-12-27 16:31:20,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:20,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475936548] [2019-12-27 16:31:20,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:21,058 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 16:31:21,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475936548] [2019-12-27 16:31:21,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:21,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:31:21,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1386318203] [2019-12-27 16:31:21,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:21,078 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:21,261 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 402 transitions. [2019-12-27 16:31:21,261 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:21,278 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:31:21,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:31:21,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:21,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:31:21,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:31:21,279 INFO L87 Difference]: Start difference. First operand 22286 states and 80860 transitions. Second operand 5 states. [2019-12-27 16:31:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:21,443 INFO L93 Difference]: Finished difference Result 33252 states and 114983 transitions. [2019-12-27 16:31:21,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:31:21,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 16:31:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:21,486 INFO L225 Difference]: With dead ends: 33252 [2019-12-27 16:31:21,486 INFO L226 Difference]: Without dead ends: 22098 [2019-12-27 16:31:21,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:31:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22098 states. [2019-12-27 16:31:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22098 to 20426. [2019-12-27 16:31:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20426 states. [2019-12-27 16:31:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20426 states to 20426 states and 73106 transitions. [2019-12-27 16:31:22,047 INFO L78 Accepts]: Start accepts. Automaton has 20426 states and 73106 transitions. Word has length 56 [2019-12-27 16:31:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:22,048 INFO L462 AbstractCegarLoop]: Abstraction has 20426 states and 73106 transitions. [2019-12-27 16:31:22,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:31:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 20426 states and 73106 transitions. [2019-12-27 16:31:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:31:22,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:22,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:22,076 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash -409451146, now seen corresponding path program 2 times [2019-12-27 16:31:22,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:22,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417702563] [2019-12-27 16:31:22,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:22,163 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 16:31:22,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417702563] [2019-12-27 16:31:22,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:22,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:31:22,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006382429] [2019-12-27 16:31:22,164 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:22,182 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:22,394 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 480 transitions. [2019-12-27 16:31:22,394 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:22,417 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:31:22,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:31:22,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:22,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:31:22,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:31:22,419 INFO L87 Difference]: Start difference. First operand 20426 states and 73106 transitions. Second operand 6 states. [2019-12-27 16:31:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:22,787 INFO L93 Difference]: Finished difference Result 34228 states and 118965 transitions. [2019-12-27 16:31:22,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:31:22,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 16:31:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:22,807 INFO L225 Difference]: With dead ends: 34228 [2019-12-27 16:31:22,807 INFO L226 Difference]: Without dead ends: 12049 [2019-12-27 16:31:22,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:31:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12049 states. [2019-12-27 16:31:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12049 to 9593. [2019-12-27 16:31:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9593 states. [2019-12-27 16:31:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9593 states to 9593 states and 29814 transitions. [2019-12-27 16:31:22,967 INFO L78 Accepts]: Start accepts. Automaton has 9593 states and 29814 transitions. Word has length 56 [2019-12-27 16:31:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:22,967 INFO L462 AbstractCegarLoop]: Abstraction has 9593 states and 29814 transitions. [2019-12-27 16:31:22,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:31:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 9593 states and 29814 transitions. [2019-12-27 16:31:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:31:22,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:22,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:22,980 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:22,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1090544788, now seen corresponding path program 1 times [2019-12-27 16:31:22,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:22,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520116468] [2019-12-27 16:31:22,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:23,035 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 16:31:23,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520116468] [2019-12-27 16:31:23,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:23,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:31:23,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1574093685] [2019-12-27 16:31:23,036 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:23,054 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:23,281 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 256 transitions. [2019-12-27 16:31:23,281 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:23,289 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:31:23,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:31:23,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:23,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:31:23,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:31:23,290 INFO L87 Difference]: Start difference. First operand 9593 states and 29814 transitions. Second operand 3 states. [2019-12-27 16:31:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:23,355 INFO L93 Difference]: Finished difference Result 11649 states and 35156 transitions. [2019-12-27 16:31:23,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:31:23,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 16:31:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:23,371 INFO L225 Difference]: With dead ends: 11649 [2019-12-27 16:31:23,371 INFO L226 Difference]: Without dead ends: 11325 [2019-12-27 16:31:23,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 16:31:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11325 states. [2019-12-27 16:31:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11325 to 9701. [2019-12-27 16:31:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9701 states. [2019-12-27 16:31:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9701 states to 9701 states and 29512 transitions. [2019-12-27 16:31:23,525 INFO L78 Accepts]: Start accepts. Automaton has 9701 states and 29512 transitions. Word has length 56 [2019-12-27 16:31:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:23,525 INFO L462 AbstractCegarLoop]: Abstraction has 9701 states and 29512 transitions. [2019-12-27 16:31:23,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:31:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 9701 states and 29512 transitions. [2019-12-27 16:31:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:31:23,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:23,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:23,536 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:23,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:23,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1851629426, now seen corresponding path program 3 times [2019-12-27 16:31:23,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:23,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950728407] [2019-12-27 16:31:23,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:23,621 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 16:31:23,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950728407] [2019-12-27 16:31:23,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:23,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:31:23,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1405239050] [2019-12-27 16:31:23,622 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:23,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:23,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 256 transitions. [2019-12-27 16:31:23,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:23,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:31:23,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:31:23,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:23,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:31:23,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:31:23,777 INFO L87 Difference]: Start difference. First operand 9701 states and 29512 transitions. Second operand 7 states. [2019-12-27 16:31:24,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:24,210 INFO L93 Difference]: Finished difference Result 26685 states and 80710 transitions. [2019-12-27 16:31:24,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:31:24,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-27 16:31:24,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:24,250 INFO L225 Difference]: With dead ends: 26685 [2019-12-27 16:31:24,251 INFO L226 Difference]: Without dead ends: 20531 [2019-12-27 16:31:24,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:31:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20531 states. [2019-12-27 16:31:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20531 to 12175. [2019-12-27 16:31:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12175 states. [2019-12-27 16:31:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12175 states to 12175 states and 37257 transitions. [2019-12-27 16:31:24,522 INFO L78 Accepts]: Start accepts. Automaton has 12175 states and 37257 transitions. Word has length 56 [2019-12-27 16:31:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:24,522 INFO L462 AbstractCegarLoop]: Abstraction has 12175 states and 37257 transitions. [2019-12-27 16:31:24,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:31:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 12175 states and 37257 transitions. [2019-12-27 16:31:24,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:31:24,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:24,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:24,536 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:24,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1882211558, now seen corresponding path program 4 times [2019-12-27 16:31:24,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:24,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784081772] [2019-12-27 16:31:24,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:24,620 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 16:31:24,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784081772] [2019-12-27 16:31:24,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:24,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:31:24,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [793665750] [2019-12-27 16:31:24,621 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:24,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:24,920 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 263 transitions. [2019-12-27 16:31:24,920 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:25,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 16:31:25,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:31:25,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:25,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:31:25,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:31:25,278 INFO L87 Difference]: Start difference. First operand 12175 states and 37257 transitions. Second operand 11 states. [2019-12-27 16:31:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:28,192 INFO L93 Difference]: Finished difference Result 88559 states and 265466 transitions. [2019-12-27 16:31:28,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 16:31:28,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 16:31:28,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:28,303 INFO L225 Difference]: With dead ends: 88559 [2019-12-27 16:31:28,303 INFO L226 Difference]: Without dead ends: 62904 [2019-12-27 16:31:28,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=433, Invalid=1729, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 16:31:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62904 states. [2019-12-27 16:31:28,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62904 to 16795. [2019-12-27 16:31:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16795 states. [2019-12-27 16:31:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16795 states to 16795 states and 51548 transitions. [2019-12-27 16:31:29,193 INFO L78 Accepts]: Start accepts. Automaton has 16795 states and 51548 transitions. Word has length 56 [2019-12-27 16:31:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:29,193 INFO L462 AbstractCegarLoop]: Abstraction has 16795 states and 51548 transitions. [2019-12-27 16:31:29,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:31:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 16795 states and 51548 transitions. [2019-12-27 16:31:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:31:29,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:29,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:29,210 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:29,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:29,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1708028504, now seen corresponding path program 5 times [2019-12-27 16:31:29,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:29,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810315861] [2019-12-27 16:31:29,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:29,284 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 16:31:29,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810315861] [2019-12-27 16:31:29,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:29,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:31:29,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1857836274] [2019-12-27 16:31:29,286 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:29,302 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:29,555 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 435 transitions. [2019-12-27 16:31:29,556 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:29,644 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 16:31:29,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:31:29,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:29,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:31:29,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:31:29,646 INFO L87 Difference]: Start difference. First operand 16795 states and 51548 transitions. Second operand 7 states. [2019-12-27 16:31:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:30,018 INFO L93 Difference]: Finished difference Result 33739 states and 100400 transitions. [2019-12-27 16:31:30,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:31:30,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-27 16:31:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:30,058 INFO L225 Difference]: With dead ends: 33739 [2019-12-27 16:31:30,058 INFO L226 Difference]: Without dead ends: 28371 [2019-12-27 16:31:30,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:31:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28371 states. [2019-12-27 16:31:30,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28371 to 17005. [2019-12-27 16:31:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17005 states. [2019-12-27 16:31:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17005 states to 17005 states and 52135 transitions. [2019-12-27 16:31:30,390 INFO L78 Accepts]: Start accepts. Automaton has 17005 states and 52135 transitions. Word has length 56 [2019-12-27 16:31:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:30,390 INFO L462 AbstractCegarLoop]: Abstraction has 17005 states and 52135 transitions. [2019-12-27 16:31:30,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:31:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 17005 states and 52135 transitions. [2019-12-27 16:31:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:31:30,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:30,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:30,408 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:30,408 INFO L82 PathProgramCache]: Analyzing trace with hash -373595762, now seen corresponding path program 6 times [2019-12-27 16:31:30,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:30,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375381700] [2019-12-27 16:31:30,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:30,512 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 16:31:30,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375381700] [2019-12-27 16:31:30,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:30,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:31:30,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [560964208] [2019-12-27 16:31:30,515 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:30,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:30,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 255 transitions. [2019-12-27 16:31:30,665 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:30,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:31:30,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:31:30,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:31:30,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:31:30,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:31:30,902 INFO L87 Difference]: Start difference. First operand 17005 states and 52135 transitions. Second operand 12 states. [2019-12-27 16:31:35,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:35,066 INFO L93 Difference]: Finished difference Result 37634 states and 111704 transitions. [2019-12-27 16:31:35,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 16:31:35,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 16:31:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:35,122 INFO L225 Difference]: With dead ends: 37634 [2019-12-27 16:31:35,123 INFO L226 Difference]: Without dead ends: 37508 [2019-12-27 16:31:35,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=361, Invalid=2089, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 16:31:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37508 states. [2019-12-27 16:31:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37508 to 23759. [2019-12-27 16:31:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23759 states. [2019-12-27 16:31:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23759 states to 23759 states and 72716 transitions. [2019-12-27 16:31:35,577 INFO L78 Accepts]: Start accepts. Automaton has 23759 states and 72716 transitions. Word has length 56 [2019-12-27 16:31:35,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:35,577 INFO L462 AbstractCegarLoop]: Abstraction has 23759 states and 72716 transitions. [2019-12-27 16:31:35,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:31:35,577 INFO L276 IsEmpty]: Start isEmpty. Operand 23759 states and 72716 transitions. [2019-12-27 16:31:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:31:35,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:35,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:35,604 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:35,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1994896084, now seen corresponding path program 7 times [2019-12-27 16:31:35,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:35,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40853931] [2019-12-27 16:31:35,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:35,711 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 16:31:35,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40853931] [2019-12-27 16:31:35,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:35,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:31:35,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300300176] [2019-12-27 16:31:35,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:35,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:35,990 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 182 transitions. [2019-12-27 16:31:35,991 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:35,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:31:35,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:31:35,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:35,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:31:35,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:31:35,992 INFO L87 Difference]: Start difference. First operand 23759 states and 72716 transitions. Second operand 3 states. [2019-12-27 16:31:36,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:36,105 INFO L93 Difference]: Finished difference Result 23757 states and 72711 transitions. [2019-12-27 16:31:36,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:31:36,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 16:31:36,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:36,155 INFO L225 Difference]: With dead ends: 23757 [2019-12-27 16:31:36,155 INFO L226 Difference]: Without dead ends: 23757 [2019-12-27 16:31:36,156 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 16:31:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23757 states. [2019-12-27 16:31:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23757 to 21769. [2019-12-27 16:31:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21769 states. [2019-12-27 16:31:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21769 states to 21769 states and 67367 transitions. [2019-12-27 16:31:36,516 INFO L78 Accepts]: Start accepts. Automaton has 21769 states and 67367 transitions. Word has length 56 [2019-12-27 16:31:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:36,516 INFO L462 AbstractCegarLoop]: Abstraction has 21769 states and 67367 transitions. [2019-12-27 16:31:36,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:31:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21769 states and 67367 transitions. [2019-12-27 16:31:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:31:36,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:36,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:36,542 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:36,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:36,542 INFO L82 PathProgramCache]: Analyzing trace with hash 423913779, now seen corresponding path program 1 times [2019-12-27 16:31:36,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:36,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477503038] [2019-12-27 16:31:36,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:31:36,607 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 16:31:36,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477503038] [2019-12-27 16:31:36,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:31:36,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:31:36,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [366284347] [2019-12-27 16:31:36,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:31:36,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:31:36,755 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 165 transitions. [2019-12-27 16:31:36,755 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:31:36,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:31:36,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:31:36,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:31:36,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:31:36,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:31:36,757 INFO L87 Difference]: Start difference. First operand 21769 states and 67367 transitions. Second operand 3 states. [2019-12-27 16:31:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:31:36,870 INFO L93 Difference]: Finished difference Result 17285 states and 52377 transitions. [2019-12-27 16:31:36,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:31:36,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 16:31:36,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:31:36,910 INFO L225 Difference]: With dead ends: 17285 [2019-12-27 16:31:36,910 INFO L226 Difference]: Without dead ends: 17285 [2019-12-27 16:31:36,911 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 16:31:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17285 states. [2019-12-27 16:31:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17285 to 16525. [2019-12-27 16:31:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16525 states. [2019-12-27 16:31:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 50068 transitions. [2019-12-27 16:31:37,273 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 50068 transitions. Word has length 57 [2019-12-27 16:31:37,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:31:37,273 INFO L462 AbstractCegarLoop]: Abstraction has 16525 states and 50068 transitions. [2019-12-27 16:31:37,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:31:37,274 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 50068 transitions. [2019-12-27 16:31:37,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 16:31:37,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:31:37,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:31:37,299 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:31:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:31:37,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1370986964, now seen corresponding path program 1 times [2019-12-27 16:31:37,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:31:37,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385661882] [2019-12-27 16:31:37,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:31:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:31:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:31:37,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:31:37,497 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:31:37,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= 0 v_~y$r_buff0_thd2~0_398) (= 0 v_~y$read_delayed_var~0.base_4) (= v_~y$w_buff1_used~0_631 0) (= v_~y$r_buff1_thd0~0_221 0) (= 0 v_~y$read_delayed_var~0.offset_4) (= 0 v_~y$r_buff1_thd2~0_382) (= 0 v_~__unbuffered_p0_EAX~0_56) (= (select .cse0 |v_ULTIMATE.start_main_~#t701~0.base_32|) 0) (< 0 |v_#StackHeapBarrier_22|) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd1~0_46 0) (= 0 v_~y$r_buff0_thd4~0_132) (= 0 v_~__unbuffered_p3_EAX~0_43) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~y$r_buff1_thd4~0_217) (= v_~main$tmp_guard1~0_34 0) (= v_~y$read_delayed~0_6 0) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t701~0.base_32| 1)) (= 0 v_~__unbuffered_p1_EAX~0_52) (= 0 v_~y$w_buff0~0_506) (= v_~z~0_169 0) (= 0 v_~weak$$choice0~0_18) (= v_~y$w_buff0_used~0_913 0) (= v_~weak$$choice2~0_212 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t701~0.base_32| 4) |v_#length_31|) (= 0 v_~y$r_buff0_thd3~0_241) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd3~0_210) (= v_~y~0_184 0) (= 0 v_~y$flush_delayed~0_45) (= v_~y$mem_tmp~0_20 0) (= |v_ULTIMATE.start_main_~#t701~0.offset_23| 0) (= v_~y$w_buff1~0_341 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t701~0.base_32| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t701~0.base_32|) |v_ULTIMATE.start_main_~#t701~0.offset_23| 0)) |v_#memory_int_25|) (= v_~y$r_buff0_thd0~0_136 0) (= v_~x~0_40 0) (= v_~y$r_buff1_thd1~0_134 0) (= v_~a~0_41 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t701~0.base_32|) (= 0 v_~__unbuffered_p3_EBX~0_43))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t702~0.base=|v_ULTIMATE.start_main_~#t702~0.base_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_77|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_210, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, #length=|v_#length_31|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_27|, ULTIMATE.start_main_~#t701~0.base=|v_ULTIMATE.start_main_~#t701~0.base_32|, ULTIMATE.start_main_~#t701~0.offset=|v_ULTIMATE.start_main_~#t701~0.offset_23|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_341, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_4, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_398, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_221, ~x~0=v_~x~0_40, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_77|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_506, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_241, ULTIMATE.start_main_~#t704~0.base=|v_ULTIMATE.start_main_~#t704~0.base_19|, ~y~0=v_~y~0_184, ULTIMATE.start_main_~#t702~0.offset=|v_ULTIMATE.start_main_~#t702~0.offset_24|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_43, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t703~0.offset=|v_ULTIMATE.start_main_~#t703~0.offset_16|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_382, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t704~0.offset=|v_ULTIMATE.start_main_~#t704~0.offset_16|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_169, ~weak$$choice2~0=v_~weak$$choice2~0_212, ULTIMATE.start_main_~#t703~0.base=|v_ULTIMATE.start_main_~#t703~0.base_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_631} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t702~0.base, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t701~0.base, ULTIMATE.start_main_~#t701~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t704~0.base, ~y~0, ULTIMATE.start_main_~#t702~0.offset, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_~#t703~0.offset, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t704~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t703~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:31:37,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L843-1-->L845: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t702~0.base_13| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t702~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t702~0.base_13|) |v_ULTIMATE.start_main_~#t702~0.offset_11| 1)) |v_#memory_int_17|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t702~0.base_13| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t702~0.base_13|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t702~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t702~0.base_13|)) (= |v_ULTIMATE.start_main_~#t702~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t702~0.base=|v_ULTIMATE.start_main_~#t702~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t702~0.offset=|v_ULTIMATE.start_main_~#t702~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t702~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t702~0.offset] because there is no mapped edge [2019-12-27 16:31:37,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L845-1-->L847: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t703~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t703~0.base_11|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t703~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t703~0.offset_9|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t703~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t703~0.base_11|) |v_ULTIMATE.start_main_~#t703~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t703~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t703~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t703~0.base=|v_ULTIMATE.start_main_~#t703~0.base_11|, ULTIMATE.start_main_~#t703~0.offset=|v_ULTIMATE.start_main_~#t703~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t703~0.base, ULTIMATE.start_main_~#t703~0.offset] because there is no mapped edge [2019-12-27 16:31:37,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L797: Formula: (and (= v_~y$r_buff0_thd3~0_37 v_~y$r_buff1_thd3~0_33) (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_36 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42 0)) (= v_~y$r_buff0_thd4~0_29 v_~y$r_buff1_thd4~0_26) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd0~0_35 v_~y$r_buff1_thd0~0_25) (= v_~z~0_14 1)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_37, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_36, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 16:31:37,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L847-1-->L849: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t704~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t704~0.base_9|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t704~0.base_9| 4) |v_#length_17|) (= 0 |v_ULTIMATE.start_main_~#t704~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t704~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t704~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t704~0.base_9|) |v_ULTIMATE.start_main_~#t704~0.offset_8| 3)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t704~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t704~0.base=|v_ULTIMATE.start_main_~#t704~0.base_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t704~0.offset=|v_ULTIMATE.start_main_~#t704~0.offset_8|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t704~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t704~0.offset, #length] because there is no mapped edge [2019-12-27 16:31:37,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_27 v_~__unbuffered_p0_EAX~0_27) (= v_~a~0_26 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~__unbuffered_cnt~0_118 (+ v_~__unbuffered_cnt~0_119 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27} OutVars{~a~0=v_~a~0_26, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 16:31:37,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-447079254 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-447079254 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-447079254 256))) (and (= (mod ~y$w_buff1_used~0_In-447079254 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-447079254 256) 0))) (= |P1Thread1of1ForFork2_#t~ite11_Out-447079254| ~y$w_buff1~0_In-447079254) .cse1 (= |P1Thread1of1ForFork2_#t~ite11_Out-447079254| |P1Thread1of1ForFork2_#t~ite12_Out-447079254|)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-447079254| ~y$w_buff1~0_In-447079254) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_In-447079254| |P1Thread1of1ForFork2_#t~ite11_Out-447079254|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-447079254, ~y$w_buff1~0=~y$w_buff1~0_In-447079254, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-447079254, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-447079254, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-447079254|, ~weak$$choice2~0=~weak$$choice2~0_In-447079254, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-447079254} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-447079254, ~y$w_buff1~0=~y$w_buff1~0_In-447079254, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-447079254, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-447079254, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-447079254|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-447079254|, ~weak$$choice2~0=~weak$$choice2~0_In-447079254, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-447079254} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:31:37,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1766902371 256) 0))) (or (and (= ~y$w_buff0_used~0_In1766902371 |P1Thread1of1ForFork2_#t~ite15_Out1766902371|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In1766902371| |P1Thread1of1ForFork2_#t~ite14_Out1766902371|)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out1766902371| |P1Thread1of1ForFork2_#t~ite15_Out1766902371|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1766902371 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1766902371 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1766902371 256))) (= 0 (mod ~y$w_buff0_used~0_In1766902371 256)))) (= ~y$w_buff0_used~0_In1766902371 |P1Thread1of1ForFork2_#t~ite14_Out1766902371|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1766902371, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1766902371, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1766902371, ~weak$$choice2~0=~weak$$choice2~0_In1766902371, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1766902371|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1766902371} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1766902371, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1766902371, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1766902371, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1766902371|, ~weak$$choice2~0=~weak$$choice2~0_In1766902371, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1766902371|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1766902371} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 16:31:37,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In233010487 256))) (.cse4 (= (mod ~y$r_buff1_thd2~0_In233010487 256) 0)) (.cse5 (= (mod ~y$w_buff0_used~0_In233010487 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In233010487 256))) (.cse6 (= (mod ~y$r_buff0_thd2~0_In233010487 256) 0)) (.cse3 (= |P1Thread1of1ForFork2_#t~ite18_Out233010487| |P1Thread1of1ForFork2_#t~ite17_Out233010487|))) (or (let ((.cse1 (not .cse6))) (and (= |P1Thread1of1ForFork2_#t~ite17_Out233010487| |P1Thread1of1ForFork2_#t~ite16_Out233010487|) .cse0 (= |P1Thread1of1ForFork2_#t~ite16_Out233010487| 0) (or .cse1 (not .cse2)) .cse3 (or (not .cse4) .cse1) (not .cse5))) (and (or (and (= |P1Thread1of1ForFork2_#t~ite17_Out233010487| |P1Thread1of1ForFork2_#t~ite17_In233010487|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite18_Out233010487| ~y$w_buff1_used~0_In233010487)) (and .cse0 (= ~y$w_buff1_used~0_In233010487 |P1Thread1of1ForFork2_#t~ite17_Out233010487|) (or (and .cse4 .cse6) .cse5 (and .cse2 .cse6)) .cse3)) (= |P1Thread1of1ForFork2_#t~ite16_In233010487| |P1Thread1of1ForFork2_#t~ite16_Out233010487|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In233010487, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_In233010487|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In233010487, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In233010487, ~weak$$choice2~0=~weak$$choice2~0_In233010487, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_In233010487|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In233010487} OutVars{P1Thread1of1ForFork2_#t~ite18=|P1Thread1of1ForFork2_#t~ite18_Out233010487|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In233010487, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_Out233010487|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In233010487, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In233010487, ~weak$$choice2~0=~weak$$choice2~0_In233010487, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_Out233010487|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In233010487} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 16:31:37,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L764-8-->L766: Formula: (and (= v_~y$r_buff0_thd2~0_378 v_~y$r_buff0_thd2~0_377) (not (= 0 (mod v_~weak$$choice2~0_200 256))) (= v_~y$w_buff1_used~0_614 |v_P1Thread1of1ForFork2_#t~ite18_33|)) InVars {P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_33|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_378, ~weak$$choice2~0=v_~weak$$choice2~0_200} OutVars{P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_32|, P1Thread1of1ForFork2_#t~ite17=|v_P1Thread1of1ForFork2_#t~ite17_30|, P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_25|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_377, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_37|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_15|, ~weak$$choice2~0=v_~weak$$choice2~0_200, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_614} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, P1Thread1of1ForFork2_#t~ite16, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:31:37,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-316083311 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite24_Out-316083311| ~y$r_buff1_thd2~0_In-316083311) (= |P1Thread1of1ForFork2_#t~ite23_In-316083311| |P1Thread1of1ForFork2_#t~ite23_Out-316083311|) (not .cse0)) (and (= ~y$r_buff1_thd2~0_In-316083311 |P1Thread1of1ForFork2_#t~ite23_Out-316083311|) .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-316083311| |P1Thread1of1ForFork2_#t~ite23_Out-316083311|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-316083311 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-316083311 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-316083311 256))) (= 0 (mod ~y$w_buff0_used~0_In-316083311 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-316083311, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-316083311, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-316083311, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-316083311|, ~weak$$choice2~0=~weak$$choice2~0_In-316083311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-316083311} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-316083311, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-316083311, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-316083311, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-316083311|, ~weak$$choice2~0=~weak$$choice2~0_In-316083311, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-316083311|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-316083311} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 16:31:37,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L768-->L776: Formula: (and (= v_~y~0_60 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_15) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~y~0=v_~y~0_60, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 16:31:37,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L820-2-->L820-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In-1112733210 256))) (.cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out-1112733210| |P3Thread1of1ForFork0_#t~ite33_Out-1112733210|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1112733210 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite32_Out-1112733210| ~y~0_In-1112733210) .cse0 (or .cse1 .cse2)) (and (= ~y$w_buff1~0_In-1112733210 |P3Thread1of1ForFork0_#t~ite32_Out-1112733210|) (not .cse1) .cse0 (not .cse2)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1112733210, ~y$w_buff1~0=~y$w_buff1~0_In-1112733210, ~y~0=~y~0_In-1112733210, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1112733210} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1112733210, ~y$w_buff1~0=~y$w_buff1~0_In-1112733210, ~y~0=~y~0_In-1112733210, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-1112733210|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1112733210|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1112733210} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 16:31:37,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In49491147 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd4~0_In49491147 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out49491147| ~y$w_buff0_used~0_In49491147) (or .cse0 .cse1)) (and (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out49491147| 0) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In49491147, ~y$w_buff0_used~0=~y$w_buff0_used~0_In49491147} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In49491147, ~y$w_buff0_used~0=~y$w_buff0_used~0_In49491147, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out49491147|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 16:31:37,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In575569122 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In575569122 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In575569122 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In575569122 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out575569122| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite35_Out575569122| ~y$w_buff1_used~0_In575569122) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In575569122, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In575569122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In575569122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In575569122} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In575569122, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In575569122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In575569122, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out575569122|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In575569122} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 16:31:37,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In-2101597856 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2101597856 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-2101597856|)) (and (= ~y$r_buff0_thd4~0_In-2101597856 |P3Thread1of1ForFork0_#t~ite36_Out-2101597856|) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2101597856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2101597856} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2101597856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2101597856, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-2101597856|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 16:31:37,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2110643987 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-2110643987 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2110643987 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-2110643987 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out-2110643987| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite37_Out-2110643987| ~y$r_buff1_thd4~0_In-2110643987) (or .cse3 .cse2)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2110643987, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2110643987, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2110643987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2110643987} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2110643987, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2110643987, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2110643987, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-2110643987|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2110643987} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 16:31:37,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L824-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_130 (+ v_~__unbuffered_cnt~0_131 1)) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_54| v_~y$r_buff1_thd4~0_148)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_148, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_53|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:31:37,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In534976233 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In534976233 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out534976233| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In534976233 |P2Thread1of1ForFork3_#t~ite28_Out534976233|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In534976233, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In534976233} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In534976233, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In534976233, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out534976233|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 16:31:37,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1294654038 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1294654038 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-1294654038 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1294654038 256) 0))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-1294654038|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1294654038 |P2Thread1of1ForFork3_#t~ite29_Out-1294654038|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1294654038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1294654038, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1294654038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1294654038} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1294654038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1294654038, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1294654038, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1294654038|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1294654038} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 16:31:37,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L800-->L801: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In90673623 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In90673623 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out90673623 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_Out90673623 ~y$r_buff0_thd3~0_In90673623)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In90673623, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In90673623} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out90673623|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In90673623, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out90673623} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 16:31:37,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-1964385803 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1964385803 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1964385803 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1964385803 256)))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out-1964385803|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1964385803 |P2Thread1of1ForFork3_#t~ite31_Out-1964385803|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1964385803, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1964385803, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1964385803, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1964385803} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1964385803, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1964385803, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1964385803, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1964385803|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1964385803} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 16:31:37,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_48| v_~y$r_buff1_thd3~0_83) (= v_~__unbuffered_cnt~0_104 (+ v_~__unbuffered_cnt~0_105 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_83, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_47|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 16:31:37,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L849-1-->L855: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:31:37,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L855-2-->L855-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1262915005 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1262915005 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1262915005| ~y$w_buff1~0_In-1262915005) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-1262915005| ~y~0_In-1262915005) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1262915005, ~y~0=~y~0_In-1262915005, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1262915005, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1262915005} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1262915005, ~y~0=~y~0_In-1262915005, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1262915005|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1262915005, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1262915005} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:31:37,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L855-4-->L856: Formula: (= v_~y~0_21 |v_ULTIMATE.start_main_#t~ite42_12|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ~y~0=v_~y~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:31:37,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1606955434 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1606955434 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1606955434| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1606955434| ~y$w_buff0_used~0_In1606955434) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1606955434, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1606955434} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1606955434, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1606955434, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1606955434|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:31:37,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1843735004 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1843735004 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1843735004 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1843735004 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1843735004|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1843735004 |ULTIMATE.start_main_#t~ite45_Out1843735004|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1843735004, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1843735004, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1843735004, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1843735004} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1843735004, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1843735004, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1843735004, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1843735004|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1843735004} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:31:37,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1279901228 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1279901228 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out1279901228| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1279901228 |ULTIMATE.start_main_#t~ite46_Out1279901228|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1279901228, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1279901228} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1279901228, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1279901228, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1279901228|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 16:31:37,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1089836311 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1089836311 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1089836311 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1089836311 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite47_Out1089836311|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1089836311 |ULTIMATE.start_main_#t~ite47_Out1089836311|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1089836311, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1089836311, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1089836311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1089836311} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1089836311, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1089836311, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1089836311|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1089836311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1089836311} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:31:37,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_155 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite47_57|) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 2 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_33) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_24 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_57|, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_56|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:31:37,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:31:37 BasicIcfg [2019-12-27 16:31:37,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:31:37,615 INFO L168 Benchmark]: Toolchain (without parser) took 127611.16 ms. Allocated memory was 144.2 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 16:31:37,616 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:31:37,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.41 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.2 MB in the beginning and 154.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:31:37,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:31:37,620 INFO L168 Benchmark]: Boogie Preprocessor took 39.29 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 149.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:31:37,620 INFO L168 Benchmark]: RCFGBuilder took 843.89 ms. Allocated memory is still 201.3 MB. Free memory was 149.4 MB in the beginning and 100.1 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:31:37,621 INFO L168 Benchmark]: TraceAbstraction took 125825.39 ms. Allocated memory was 201.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 16:31:37,626 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.45 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.41 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.2 MB in the beginning and 154.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.29 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 149.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 843.89 ms. Allocated memory is still 201.3 MB. Free memory was 149.4 MB in the beginning and 100.1 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 125825.39 ms. Allocated memory was 201.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.9s, 181 ProgramPointsBefore, 87 ProgramPointsAfterwards, 209 TransitionsBefore, 92 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 7916 VarBasedMoverChecksPositive, 275 VarBasedMoverChecksNegative, 100 SemBasedMoverChecksPositive, 248 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66604 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t701, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L845] FCALL, FORK 0 pthread_create(&t702, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L847] FCALL, FORK 0 pthread_create(&t703, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L781] 3 y$w_buff1 = y$w_buff0 [L782] 3 y$w_buff0 = 1 [L783] 3 y$w_buff1_used = y$w_buff0_used [L784] 3 y$w_buff0_used = (_Bool)1 [L849] FCALL, FORK 0 pthread_create(&t704, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L811] 4 z = 2 [L814] 4 __unbuffered_p3_EAX = z [L817] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L753] 2 x = 1 [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L760] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L760] 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) [L761] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L761] 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)) [L762] 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)) [L763] 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] 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)) [L767] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L820] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L821] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L822] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L823] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L855] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 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 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 125.5s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 37.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3277 SDtfs, 4727 SDslu, 8173 SDs, 0 SdLazy, 5483 SolverSat, 298 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 94 SyntacticMatches, 31 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210054occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 143257 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 706 ConstructedInterpolants, 0 QuantifiedInterpolants, 120646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...