/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/mix042_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:02:25,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:02:25,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:02:25,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:02:25,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:02:25,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:02:25,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:02:25,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:02:25,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:02:25,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:02:25,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:02:25,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:02:25,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:02:25,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:02:25,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:02:25,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:02:25,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:02:25,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:02:25,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:02:25,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:02:25,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:02:25,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:02:25,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:02:25,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:02:25,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:02:25,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:02:25,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:02:25,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:02:25,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:02:25,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:02:25,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:02:25,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:02:25,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:02:25,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:02:25,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:02:25,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:02:25,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:02:25,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:02:25,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:02:25,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:02:25,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:02:25,744 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 17:02:25,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:02:25,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:02:25,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:02:25,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:02:25,760 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:02:25,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:02:25,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:02:25,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:02:25,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:02:25,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:02:25,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:02:25,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:02:25,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:02:25,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:02:25,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:02:25,762 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:02:25,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:02:25,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:02:25,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:02:25,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:02:25,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:02:25,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:02:25,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:02:25,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:02:25,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:02:25,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:02:25,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:02:25,765 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:02:25,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:02:25,765 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:02:25,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:02:26,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:02:26,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:02:26,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:02:26,051 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:02:26,051 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:02:26,052 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2019-12-27 17:02:26,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e21ac813/9b5a72f9a153452bacbdb9299792748b/FLAGc5a00ba39 [2019-12-27 17:02:26,657 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:02:26,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2019-12-27 17:02:26,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e21ac813/9b5a72f9a153452bacbdb9299792748b/FLAGc5a00ba39 [2019-12-27 17:02:26,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e21ac813/9b5a72f9a153452bacbdb9299792748b [2019-12-27 17:02:26,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:02:26,961 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:02:26,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:02:26,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:02:26,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:02:26,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:02:26" (1/1) ... [2019-12-27 17:02:26,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb8c5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:26, skipping insertion in model container [2019-12-27 17:02:26,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:02:26" (1/1) ... [2019-12-27 17:02:26,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:02:27,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:02:27,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:02:27,539 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:02:27,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:02:27,708 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:02:27,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27 WrapperNode [2019-12-27 17:02:27,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:02:27,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:02:27,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:02:27,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:02:27,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27" (1/1) ... [2019-12-27 17:02:27,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27" (1/1) ... [2019-12-27 17:02:27,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:02:27,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:02:27,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:02:27,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:02:27,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27" (1/1) ... [2019-12-27 17:02:27,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27" (1/1) ... [2019-12-27 17:02:27,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27" (1/1) ... [2019-12-27 17:02:27,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27" (1/1) ... [2019-12-27 17:02:27,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27" (1/1) ... [2019-12-27 17:02:27,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27" (1/1) ... [2019-12-27 17:02:27,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27" (1/1) ... [2019-12-27 17:02:27,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:02:27,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:02:27,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:02:27,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:02:27,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27" (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 17:02:27,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:02:27,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:02:27,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:02:27,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:02:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:02:27,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:02:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:02:27,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:02:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:02:27,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:02:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:02:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:02:27,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:02:27,900 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 17:02:28,603 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:02:28,603 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:02:28,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:02:28 BoogieIcfgContainer [2019-12-27 17:02:28,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:02:28,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:02:28,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:02:28,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:02:28,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:02:26" (1/3) ... [2019-12-27 17:02:28,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511d15d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:02:28, skipping insertion in model container [2019-12-27 17:02:28,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27" (2/3) ... [2019-12-27 17:02:28,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511d15d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:02:28, skipping insertion in model container [2019-12-27 17:02:28,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:02:28" (3/3) ... [2019-12-27 17:02:28,614 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_power.opt.i [2019-12-27 17:02:28,624 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:02:28,624 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:02:28,635 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:02:28,636 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:02:28,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,693 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,694 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,702 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,702 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,702 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,703 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,703 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,713 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,714 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,719 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,719 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,720 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:28,739 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:02:28,774 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:02:28,774 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:02:28,774 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:02:28,774 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:02:28,774 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:02:28,774 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:02:28,774 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:02:28,775 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:02:28,791 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 17:02:28,793 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 17:02:28,883 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 17:02:28,883 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:02:28,896 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:02:28,915 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 17:02:28,962 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 17:02:28,963 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:02:28,968 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:02:28,982 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 17:02:28,984 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:02:33,734 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 17:02:33,880 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 17:02:33,899 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-27 17:02:33,899 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 17:02:33,902 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-27 17:02:34,728 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-27 17:02:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-27 17:02:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 17:02:34,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:34,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:34,737 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:34,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:34,743 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-27 17:02:34,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:34,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126780641] [2019-12-27 17:02:34,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:35,050 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 17:02:35,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126780641] [2019-12-27 17:02:35,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:35,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:02:35,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1404262406] [2019-12-27 17:02:35,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:35,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:35,073 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 17:02:35,074 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:35,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:35,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:02:35,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:35,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:02:35,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:02:35,096 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-27 17:02:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:35,378 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-27 17:02:35,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:02:35,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 17:02:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:35,518 INFO L225 Difference]: With dead ends: 14182 [2019-12-27 17:02:35,519 INFO L226 Difference]: Without dead ends: 13870 [2019-12-27 17:02:35,520 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 17:02:35,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-27 17:02:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-27 17:02:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-27 17:02:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-27 17:02:36,290 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-27 17:02:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:36,292 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-27 17:02:36,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:02:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-27 17:02:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:02:36,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:36,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:36,304 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:36,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:36,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-27 17:02:36,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:36,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772102249] [2019-12-27 17:02:36,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:36,456 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 17:02:36,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772102249] [2019-12-27 17:02:36,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:36,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:02:36,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1866863310] [2019-12-27 17:02:36,457 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:36,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:36,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:02:36,463 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:36,464 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:36,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:02:36,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:36,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:02:36,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:02:36,466 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-27 17:02:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:36,840 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-27 17:02:36,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:02:36,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 17:02:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:36,942 INFO L225 Difference]: With dead ends: 19034 [2019-12-27 17:02:36,942 INFO L226 Difference]: Without dead ends: 19034 [2019-12-27 17:02:36,943 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 17:02:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-27 17:02:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-27 17:02:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-27 17:02:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-27 17:02:38,671 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-27 17:02:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:38,672 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-27 17:02:38,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:02:38,672 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-27 17:02:38,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:02:38,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:38,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:38,676 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-27 17:02:38,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:38,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139706120] [2019-12-27 17:02:38,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:38,795 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 17:02:38,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139706120] [2019-12-27 17:02:38,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:38,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:02:38,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [680701447] [2019-12-27 17:02:38,798 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:38,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:38,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 17:02:38,803 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:38,996 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-12-27 17:02:38,997 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:02:38,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:02:39,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:39,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:02:39,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:02:39,002 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 5 states. [2019-12-27 17:02:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:39,395 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-27 17:02:39,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:02:39,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 17:02:39,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:39,496 INFO L225 Difference]: With dead ends: 27022 [2019-12-27 17:02:39,497 INFO L226 Difference]: Without dead ends: 27008 [2019-12-27 17:02:39,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:02:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-27 17:02:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-27 17:02:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-27 17:02:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-27 17:02:40,490 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-27 17:02:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:40,491 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-27 17:02:40,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:02:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-27 17:02:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 17:02:40,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:40,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:40,498 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-27 17:02:40,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:40,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799969003] [2019-12-27 17:02:40,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:40,632 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 17:02:40,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799969003] [2019-12-27 17:02:40,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:40,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:02:40,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1118005966] [2019-12-27 17:02:40,633 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:40,637 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:40,641 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 24 transitions. [2019-12-27 17:02:40,641 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:40,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:40,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:02:40,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:40,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:02:40,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:02:40,643 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 5 states. [2019-12-27 17:02:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:41,210 INFO L93 Difference]: Finished difference Result 30132 states and 106959 transitions. [2019-12-27 17:02:41,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:02:41,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 17:02:41,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:41,293 INFO L225 Difference]: With dead ends: 30132 [2019-12-27 17:02:41,293 INFO L226 Difference]: Without dead ends: 30118 [2019-12-27 17:02:41,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:02:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30118 states. [2019-12-27 17:02:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30118 to 22270. [2019-12-27 17:02:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22270 states. [2019-12-27 17:02:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22270 states to 22270 states and 80486 transitions. [2019-12-27 17:02:43,190 INFO L78 Accepts]: Start accepts. Automaton has 22270 states and 80486 transitions. Word has length 19 [2019-12-27 17:02:43,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:43,190 INFO L462 AbstractCegarLoop]: Abstraction has 22270 states and 80486 transitions. [2019-12-27 17:02:43,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:02:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 22270 states and 80486 transitions. [2019-12-27 17:02:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:02:43,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:43,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:43,213 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:43,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:43,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023153, now seen corresponding path program 1 times [2019-12-27 17:02:43,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:43,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996234929] [2019-12-27 17:02:43,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:43,314 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 17:02:43,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996234929] [2019-12-27 17:02:43,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:43,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:02:43,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1750650082] [2019-12-27 17:02:43,316 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:43,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:43,329 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:02:43,330 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:43,330 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:43,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:02:43,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:43,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:02:43,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:02:43,331 INFO L87 Difference]: Start difference. First operand 22270 states and 80486 transitions. Second operand 4 states. [2019-12-27 17:02:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:43,401 INFO L93 Difference]: Finished difference Result 13342 states and 41523 transitions. [2019-12-27 17:02:43,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:02:43,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 17:02:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:43,421 INFO L225 Difference]: With dead ends: 13342 [2019-12-27 17:02:43,421 INFO L226 Difference]: Without dead ends: 12812 [2019-12-27 17:02:43,421 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 17:02:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12812 states. [2019-12-27 17:02:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12812 to 12812. [2019-12-27 17:02:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12812 states. [2019-12-27 17:02:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12812 states to 12812 states and 40017 transitions. [2019-12-27 17:02:43,905 INFO L78 Accepts]: Start accepts. Automaton has 12812 states and 40017 transitions. Word has length 27 [2019-12-27 17:02:43,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:43,906 INFO L462 AbstractCegarLoop]: Abstraction has 12812 states and 40017 transitions. [2019-12-27 17:02:43,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:02:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 12812 states and 40017 transitions. [2019-12-27 17:02:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 17:02:43,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:43,916 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 17:02:43,916 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1806206056, now seen corresponding path program 1 times [2019-12-27 17:02:43,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:43,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334194516] [2019-12-27 17:02:43,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:43,997 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 17:02:43,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334194516] [2019-12-27 17:02:43,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:43,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:02:43,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [32907895] [2019-12-27 17:02:43,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:44,003 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:44,012 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 36 transitions. [2019-12-27 17:02:44,012 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:44,032 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:02:44,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:02:44,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:44,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:02:44,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:02:44,033 INFO L87 Difference]: Start difference. First operand 12812 states and 40017 transitions. Second operand 6 states. [2019-12-27 17:02:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:44,099 INFO L93 Difference]: Finished difference Result 2336 states and 5507 transitions. [2019-12-27 17:02:44,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:02:44,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 17:02:44,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:44,103 INFO L225 Difference]: With dead ends: 2336 [2019-12-27 17:02:44,103 INFO L226 Difference]: Without dead ends: 2027 [2019-12-27 17:02:44,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:02:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-12-27 17:02:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2027. [2019-12-27 17:02:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-12-27 17:02:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 4646 transitions. [2019-12-27 17:02:44,136 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 4646 transitions. Word has length 28 [2019-12-27 17:02:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:44,137 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 4646 transitions. [2019-12-27 17:02:44,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:02:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 4646 transitions. [2019-12-27 17:02:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 17:02:44,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:44,141 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] [2019-12-27 17:02:44,141 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:44,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1654876811, now seen corresponding path program 1 times [2019-12-27 17:02:44,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:44,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142663001] [2019-12-27 17:02:44,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:44,242 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 17:02:44,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142663001] [2019-12-27 17:02:44,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:44,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:02:44,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340916557] [2019-12-27 17:02:44,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:44,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:44,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 96 transitions. [2019-12-27 17:02:44,279 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:44,316 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:02:44,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:02:44,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:02:44,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:02:44,317 INFO L87 Difference]: Start difference. First operand 2027 states and 4646 transitions. Second operand 8 states. [2019-12-27 17:02:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:44,404 INFO L93 Difference]: Finished difference Result 690 states and 1578 transitions. [2019-12-27 17:02:44,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:02:44,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 17:02:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:44,405 INFO L225 Difference]: With dead ends: 690 [2019-12-27 17:02:44,405 INFO L226 Difference]: Without dead ends: 644 [2019-12-27 17:02:44,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:02:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-27 17:02:44,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 588. [2019-12-27 17:02:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-27 17:02:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1356 transitions. [2019-12-27 17:02:44,416 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1356 transitions. Word has length 40 [2019-12-27 17:02:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:44,416 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1356 transitions. [2019-12-27 17:02:44,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:02:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1356 transitions. [2019-12-27 17:02:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:02:44,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:44,419 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] [2019-12-27 17:02:44,419 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:44,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:44,419 INFO L82 PathProgramCache]: Analyzing trace with hash 149828223, now seen corresponding path program 1 times [2019-12-27 17:02:44,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:44,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155080819] [2019-12-27 17:02:44,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:44,495 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 17:02:44,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155080819] [2019-12-27 17:02:44,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:44,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:02:44,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [429124638] [2019-12-27 17:02:44,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:44,510 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:44,566 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 133 transitions. [2019-12-27 17:02:44,566 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:44,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:44,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:02:44,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:44,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:02:44,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:02:44,568 INFO L87 Difference]: Start difference. First operand 588 states and 1356 transitions. Second operand 3 states. [2019-12-27 17:02:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:44,607 INFO L93 Difference]: Finished difference Result 602 states and 1375 transitions. [2019-12-27 17:02:44,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:02:44,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 17:02:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:44,609 INFO L225 Difference]: With dead ends: 602 [2019-12-27 17:02:44,609 INFO L226 Difference]: Without dead ends: 602 [2019-12-27 17:02:44,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:02:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-12-27 17:02:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 596. [2019-12-27 17:02:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-27 17:02:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1368 transitions. [2019-12-27 17:02:44,617 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1368 transitions. Word has length 55 [2019-12-27 17:02:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:44,618 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1368 transitions. [2019-12-27 17:02:44,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:02:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1368 transitions. [2019-12-27 17:02:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:02:44,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:44,620 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] [2019-12-27 17:02:44,620 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:44,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:44,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1719525699, now seen corresponding path program 1 times [2019-12-27 17:02:44,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:44,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747493168] [2019-12-27 17:02:44,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:44,860 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 17:02:44,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747493168] [2019-12-27 17:02:44,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:44,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:02:44,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1855225896] [2019-12-27 17:02:44,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:44,878 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:44,920 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 133 transitions. [2019-12-27 17:02:44,920 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:44,930 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:02:44,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:02:44,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:44,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:02:44,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:02:44,931 INFO L87 Difference]: Start difference. First operand 596 states and 1368 transitions. Second operand 5 states. [2019-12-27 17:02:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:45,128 INFO L93 Difference]: Finished difference Result 867 states and 1997 transitions. [2019-12-27 17:02:45,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:02:45,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 17:02:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:45,130 INFO L225 Difference]: With dead ends: 867 [2019-12-27 17:02:45,130 INFO L226 Difference]: Without dead ends: 867 [2019-12-27 17:02:45,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:02:45,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-12-27 17:02:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 789. [2019-12-27 17:02:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-27 17:02:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1820 transitions. [2019-12-27 17:02:45,144 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1820 transitions. Word has length 55 [2019-12-27 17:02:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:45,145 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1820 transitions. [2019-12-27 17:02:45,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:02:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1820 transitions. [2019-12-27 17:02:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:02:45,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:45,147 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] [2019-12-27 17:02:45,147 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:45,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1740404695, now seen corresponding path program 2 times [2019-12-27 17:02:45,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:45,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223720961] [2019-12-27 17:02:45,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:45,220 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 17:02:45,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223720961] [2019-12-27 17:02:45,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:45,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:02:45,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1448120202] [2019-12-27 17:02:45,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:45,238 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:45,295 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 129 transitions. [2019-12-27 17:02:45,295 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:45,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:45,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:02:45,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:45,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:02:45,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:02:45,297 INFO L87 Difference]: Start difference. First operand 789 states and 1820 transitions. Second operand 3 states. [2019-12-27 17:02:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:45,338 INFO L93 Difference]: Finished difference Result 789 states and 1819 transitions. [2019-12-27 17:02:45,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:02:45,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 17:02:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:45,340 INFO L225 Difference]: With dead ends: 789 [2019-12-27 17:02:45,340 INFO L226 Difference]: Without dead ends: 789 [2019-12-27 17:02:45,340 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 17:02:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-27 17:02:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 632. [2019-12-27 17:02:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-12-27 17:02:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1459 transitions. [2019-12-27 17:02:45,351 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1459 transitions. Word has length 55 [2019-12-27 17:02:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:45,352 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 1459 transitions. [2019-12-27 17:02:45,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:02:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1459 transitions. [2019-12-27 17:02:45,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 17:02:45,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:45,354 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 17:02:45,354 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:45,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:45,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 1 times [2019-12-27 17:02:45,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:45,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347361747] [2019-12-27 17:02:45,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:45,431 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 17:02:45,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347361747] [2019-12-27 17:02:45,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:45,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:02:45,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1908616413] [2019-12-27 17:02:45,433 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:45,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:45,514 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 129 transitions. [2019-12-27 17:02:45,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:45,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:02:45,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:02:45,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:45,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:02:45,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:02:45,538 INFO L87 Difference]: Start difference. First operand 632 states and 1459 transitions. Second operand 5 states. [2019-12-27 17:02:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:45,703 INFO L93 Difference]: Finished difference Result 812 states and 1818 transitions. [2019-12-27 17:02:45,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:02:45,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 17:02:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:45,705 INFO L225 Difference]: With dead ends: 812 [2019-12-27 17:02:45,705 INFO L226 Difference]: Without dead ends: 812 [2019-12-27 17:02:45,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:02:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-12-27 17:02:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 596. [2019-12-27 17:02:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-27 17:02:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1343 transitions. [2019-12-27 17:02:45,716 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1343 transitions. Word has length 56 [2019-12-27 17:02:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:45,716 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1343 transitions. [2019-12-27 17:02:45,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:02:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1343 transitions. [2019-12-27 17:02:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:02:45,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:45,718 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 17:02:45,718 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:45,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:45,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-27 17:02:45,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:45,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994711090] [2019-12-27 17:02:45,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:46,019 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 17:02:46,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994711090] [2019-12-27 17:02:46,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:46,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:02:46,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [634382534] [2019-12-27 17:02:46,021 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:46,058 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:46,260 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 132 transitions. [2019-12-27 17:02:46,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:46,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:02:46,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:02:46,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:46,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:02:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:02:46,309 INFO L87 Difference]: Start difference. First operand 596 states and 1343 transitions. Second operand 13 states. [2019-12-27 17:02:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:47,015 INFO L93 Difference]: Finished difference Result 1200 states and 2407 transitions. [2019-12-27 17:02:47,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 17:02:47,015 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 17:02:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:47,017 INFO L225 Difference]: With dead ends: 1200 [2019-12-27 17:02:47,017 INFO L226 Difference]: Without dead ends: 600 [2019-12-27 17:02:47,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:02:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-27 17:02:47,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2019-12-27 17:02:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-12-27 17:02:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1164 transitions. [2019-12-27 17:02:47,025 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1164 transitions. Word has length 57 [2019-12-27 17:02:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:47,026 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 1164 transitions. [2019-12-27 17:02:47,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:02:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1164 transitions. [2019-12-27 17:02:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:02:47,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:47,027 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 17:02:47,027 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:47,028 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-27 17:02:47,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:47,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352389297] [2019-12-27 17:02:47,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:47,609 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 17:02:47,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352389297] [2019-12-27 17:02:47,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:47,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 17:02:47,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [818222760] [2019-12-27 17:02:47,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:47,627 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:47,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 130 transitions. [2019-12-27 17:02:47,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:47,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:02:47,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:02:47,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:02:48,058 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-12-27 17:02:48,059 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 17:02:48,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 17:02:48,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:48,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 17:02:48,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:02:48,060 INFO L87 Difference]: Start difference. First operand 534 states and 1164 transitions. Second operand 23 states. [2019-12-27 17:02:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:50,106 INFO L93 Difference]: Finished difference Result 1295 states and 2888 transitions. [2019-12-27 17:02:50,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 17:02:50,107 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2019-12-27 17:02:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:50,109 INFO L225 Difference]: With dead ends: 1295 [2019-12-27 17:02:50,109 INFO L226 Difference]: Without dead ends: 1265 [2019-12-27 17:02:50,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=289, Invalid=1517, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 17:02:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-12-27 17:02:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 716. [2019-12-27 17:02:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-12-27 17:02:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1564 transitions. [2019-12-27 17:02:50,124 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1564 transitions. Word has length 57 [2019-12-27 17:02:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:50,125 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1564 transitions. [2019-12-27 17:02:50,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 17:02:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1564 transitions. [2019-12-27 17:02:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:02:50,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:50,127 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 17:02:50,127 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:50,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash -495942269, now seen corresponding path program 3 times [2019-12-27 17:02:50,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:50,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363949895] [2019-12-27 17:02:50,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:50,455 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 17:02:50,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363949895] [2019-12-27 17:02:50,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:50,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:02:50,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [54066367] [2019-12-27 17:02:50,457 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:50,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:50,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 122 transitions. [2019-12-27 17:02:50,544 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:50,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:02:50,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:02:50,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 17:02:50,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:50,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 17:02:50,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:02:50,687 INFO L87 Difference]: Start difference. First operand 716 states and 1564 transitions. Second operand 18 states. [2019-12-27 17:02:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:52,433 INFO L93 Difference]: Finished difference Result 1591 states and 3443 transitions. [2019-12-27 17:02:52,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 17:02:52,434 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-27 17:02:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:52,436 INFO L225 Difference]: With dead ends: 1591 [2019-12-27 17:02:52,436 INFO L226 Difference]: Without dead ends: 1561 [2019-12-27 17:02:52,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=296, Invalid=1344, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 17:02:52,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2019-12-27 17:02:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 772. [2019-12-27 17:02:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-12-27 17:02:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1700 transitions. [2019-12-27 17:02:52,458 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1700 transitions. Word has length 57 [2019-12-27 17:02:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:52,458 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1700 transitions. [2019-12-27 17:02:52,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 17:02:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1700 transitions. [2019-12-27 17:02:52,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:02:52,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:52,460 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 17:02:52,461 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:52,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:52,461 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 4 times [2019-12-27 17:02:52,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:52,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550152692] [2019-12-27 17:02:52,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:02:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:02:52,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:02:52,624 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:02:52,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1108~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1108~0.base_27|) |v_ULTIMATE.start_main_~#t1108~0.offset_21| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff1_thd2~0_113) (= v_~main$tmp_guard1~0_30 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1108~0.base_27| 1) |v_#valid_54|) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1108~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd1~0_41 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1108~0.base_27|)) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= |v_ULTIMATE.start_main_~#t1108~0.offset_21| 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1108~0.base_27|) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, ULTIMATE.start_main_~#t1109~0.base=|v_ULTIMATE.start_main_~#t1109~0.base_26|, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ULTIMATE.start_main_~#t1108~0.offset=|v_ULTIMATE.start_main_~#t1108~0.offset_21|, ULTIMATE.start_main_~#t1110~0.base=|v_ULTIMATE.start_main_~#t1110~0.base_21|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ULTIMATE.start_main_~#t1110~0.offset=|v_ULTIMATE.start_main_~#t1110~0.offset_16|, ~y~0=v_~y~0_123, ULTIMATE.start_main_~#t1108~0.base=|v_ULTIMATE.start_main_~#t1108~0.base_27|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_~#t1109~0.offset=|v_ULTIMATE.start_main_~#t1109~0.offset_20|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1109~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__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~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1108~0.offset, ULTIMATE.start_main_~#t1110~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1110~0.offset, ~y~0, ULTIMATE.start_main_~#t1108~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_~#t1109~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:02:52,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1109~0.base_9| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1109~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1109~0.base_9| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t1109~0.offset_8| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1109~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1109~0.base_9|) |v_ULTIMATE.start_main_~#t1109~0.offset_8| 1))) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1109~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1109~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1109~0.offset=|v_ULTIMATE.start_main_~#t1109~0.offset_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1109~0.base=|v_ULTIMATE.start_main_~#t1109~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1109~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1109~0.base, #length] because there is no mapped edge [2019-12-27 17:02:52,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1110~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1110~0.base_10|) |v_ULTIMATE.start_main_~#t1110~0.offset_10| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t1110~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1110~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1110~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1110~0.offset_10|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1110~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1110~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1110~0.base=|v_ULTIMATE.start_main_~#t1110~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1110~0.offset=|v_ULTIMATE.start_main_~#t1110~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1110~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1110~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 17:02:52,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~a~0_In-40763494 ~__unbuffered_p2_EBX~0_Out-40763494) (= ~y$r_buff1_thd2~0_Out-40763494 ~y$r_buff0_thd2~0_In-40763494) (= ~y$r_buff0_thd3~0_In-40763494 ~y$r_buff1_thd3~0_Out-40763494) (= ~__unbuffered_p2_EAX~0_Out-40763494 ~z~0_Out-40763494) (= ~z~0_Out-40763494 1) (= ~y$r_buff1_thd0~0_Out-40763494 ~y$r_buff0_thd0~0_In-40763494) (= 1 ~y$r_buff0_thd3~0_Out-40763494) (= ~y$r_buff0_thd1~0_In-40763494 ~y$r_buff1_thd1~0_Out-40763494) (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-40763494))) InVars {~a~0=~a~0_In-40763494, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-40763494, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-40763494, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-40763494, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-40763494, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-40763494} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-40763494, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-40763494, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-40763494, ~a~0=~a~0_In-40763494, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-40763494, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-40763494, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-40763494, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-40763494, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-40763494, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-40763494, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-40763494, ~z~0=~z~0_Out-40763494, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-40763494} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 17:02:52,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.base_10 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_10| v_P0Thread1of1ForFork2_~arg.offset_10) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 17:02:52,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork0_#t~ite4_Out497078788| |P1Thread1of1ForFork0_#t~ite3_Out497078788|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In497078788 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In497078788 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In497078788 |P1Thread1of1ForFork0_#t~ite3_Out497078788|) (not .cse1) .cse2) (and (= ~y~0_In497078788 |P1Thread1of1ForFork0_#t~ite3_Out497078788|) .cse2 (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In497078788, ~y$w_buff1~0=~y$w_buff1~0_In497078788, ~y~0=~y~0_In497078788, ~y$w_buff1_used~0=~y$w_buff1_used~0_In497078788} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In497078788, ~y$w_buff1~0=~y$w_buff1~0_In497078788, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out497078788|, ~y~0=~y~0_In497078788, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out497078788|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In497078788} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 17:02:52,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1075652419 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1075652419 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite11_Out1075652419|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1075652419 |P2Thread1of1ForFork1_#t~ite11_Out1075652419|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1075652419, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1075652419} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1075652419, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1075652419|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1075652419} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 17:02:52,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In1196841174 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1196841174 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1196841174 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In1196841174 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite12_Out1196841174|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1196841174 |P2Thread1of1ForFork1_#t~ite12_Out1196841174|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1196841174, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1196841174, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1196841174, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1196841174} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1196841174, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1196841174, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1196841174, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1196841174|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1196841174} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 17:02:52,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1823785237 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1823785237 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out-1823785237 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-1823785237 ~y$r_buff0_thd3~0_Out-1823785237)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1823785237, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1823785237} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out-1823785237|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1823785237, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1823785237} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 17:02:52,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In2133768487 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2133768487 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2133768487 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In2133768487 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_Out2133768487| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite14_Out2133768487| ~y$r_buff1_thd3~0_In2133768487)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2133768487, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2133768487, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2133768487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2133768487} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out2133768487|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2133768487, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2133768487, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2133768487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2133768487} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:02:52,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite14_36| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_35|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 17:02:52,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-943230581 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-943230581 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out-943230581|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-943230581 |P1Thread1of1ForFork0_#t~ite5_Out-943230581|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-943230581, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-943230581} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-943230581, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-943230581, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-943230581|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:02:52,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1568820306 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1568820306 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1568820306 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1568820306 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite6_Out1568820306| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite6_Out1568820306| ~y$w_buff1_used~0_In1568820306)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1568820306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1568820306, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1568820306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1568820306} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1568820306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1568820306, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1568820306, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out1568820306|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1568820306} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:02:52,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In212310350 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In212310350 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite7_Out212310350|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In212310350 |P1Thread1of1ForFork0_#t~ite7_Out212310350|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In212310350, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In212310350} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In212310350, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In212310350, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out212310350|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 17:02:52,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1192543321 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1192543321 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1192543321 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1192543321 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite8_Out-1192543321|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1192543321 |P1Thread1of1ForFork0_#t~ite8_Out-1192543321|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1192543321, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1192543321, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1192543321, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1192543321} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1192543321, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1192543321, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1192543321, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-1192543321|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1192543321} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:02:52,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_38|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_38|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_37|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 17:02:52,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:02:52,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1160618584 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite18_Out1160618584| |ULTIMATE.start_main_#t~ite19_Out1160618584|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1160618584 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite18_Out1160618584| ~y~0_In1160618584)) (and (not .cse2) (= ~y$w_buff1~0_In1160618584 |ULTIMATE.start_main_#t~ite18_Out1160618584|) .cse0 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1160618584, ~y~0=~y~0_In1160618584, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1160618584, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1160618584} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1160618584, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1160618584|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1160618584|, ~y~0=~y~0_In1160618584, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1160618584, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1160618584} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:02:52,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-698493832 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-698493832 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-698493832| 0)) (and (= |ULTIMATE.start_main_#t~ite20_Out-698493832| ~y$w_buff0_used~0_In-698493832) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-698493832, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-698493832} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-698493832, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-698493832, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-698493832|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:02:52,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In719164731 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In719164731 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In719164731 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In719164731 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out719164731| 0)) (and (= |ULTIMATE.start_main_#t~ite21_Out719164731| ~y$w_buff1_used~0_In719164731) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In719164731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In719164731, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In719164731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In719164731} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In719164731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In719164731, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out719164731|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In719164731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In719164731} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:02:52,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1976144321 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1976144321 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1976144321| ~y$r_buff0_thd0~0_In1976144321) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1976144321| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1976144321, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1976144321} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1976144321, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1976144321, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1976144321|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:02:52,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In533089617 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In533089617 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In533089617 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In533089617 256)))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out533089617| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite23_Out533089617| ~y$r_buff1_thd0~0_In533089617)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In533089617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In533089617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In533089617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In533089617} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In533089617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In533089617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In533089617, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out533089617|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In533089617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 17:02:52,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1991595457 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite29_In-1991595457| |ULTIMATE.start_main_#t~ite29_Out-1991595457|) (= |ULTIMATE.start_main_#t~ite30_Out-1991595457| ~y$w_buff0~0_In-1991595457)) (and (= |ULTIMATE.start_main_#t~ite30_Out-1991595457| |ULTIMATE.start_main_#t~ite29_Out-1991595457|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1991595457 256) 0))) (or (and (= (mod ~y$r_buff1_thd0~0_In-1991595457 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1991595457 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1991595457 256))))) (= ~y$w_buff0~0_In-1991595457 |ULTIMATE.start_main_#t~ite29_Out-1991595457|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1991595457, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1991595457|, ~y$w_buff0~0=~y$w_buff0~0_In-1991595457, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1991595457, ~weak$$choice2~0=~weak$$choice2~0_In-1991595457, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1991595457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1991595457} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1991595457|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1991595457, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1991595457|, ~y$w_buff0~0=~y$w_buff0~0_In-1991595457, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1991595457, ~weak$$choice2~0=~weak$$choice2~0_In-1991595457, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1991595457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1991595457} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 17:02:52,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1815384230 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out1815384230| |ULTIMATE.start_main_#t~ite36_Out1815384230|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1815384230 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1815384230 256))) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In1815384230 256) 0)) (= (mod ~y$w_buff0_used~0_In1815384230 256) 0))) .cse1 (= |ULTIMATE.start_main_#t~ite35_Out1815384230| ~y$w_buff0_used~0_In1815384230)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1815384230| ~y$w_buff0_used~0_In1815384230) (= |ULTIMATE.start_main_#t~ite35_In1815384230| |ULTIMATE.start_main_#t~ite35_Out1815384230|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1815384230, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1815384230, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In1815384230|, ~weak$$choice2~0=~weak$$choice2~0_In1815384230, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1815384230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1815384230} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1815384230, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1815384230, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1815384230|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1815384230|, ~weak$$choice2~0=~weak$$choice2~0_In1815384230, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1815384230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1815384230} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 17:02:52,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-170866210 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-170866210| ~y$w_buff1_used~0_In-170866210) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In-170866210| |ULTIMATE.start_main_#t~ite38_Out-170866210|)) (and (= |ULTIMATE.start_main_#t~ite39_Out-170866210| |ULTIMATE.start_main_#t~ite38_Out-170866210|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-170866210 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-170866210 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-170866210 256))) (= 0 (mod ~y$w_buff0_used~0_In-170866210 256)))) .cse0 (= ~y$w_buff1_used~0_In-170866210 |ULTIMATE.start_main_#t~ite38_Out-170866210|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-170866210, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-170866210, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-170866210|, ~weak$$choice2~0=~weak$$choice2~0_In-170866210, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-170866210, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-170866210} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-170866210, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-170866210|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-170866210, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-170866210|, ~weak$$choice2~0=~weak$$choice2~0_In-170866210, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-170866210, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-170866210} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 17:02:52,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:02:52,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2136486380 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2136486380 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In2136486380 256)) (and (= 0 (mod ~y$w_buff1_used~0_In2136486380 256)) .cse0) (and (= (mod ~y$r_buff1_thd0~0_In2136486380 256) 0) .cse0))) (= ~y$r_buff1_thd0~0_In2136486380 |ULTIMATE.start_main_#t~ite44_Out2136486380|) (= |ULTIMATE.start_main_#t~ite44_Out2136486380| |ULTIMATE.start_main_#t~ite45_Out2136486380|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_In2136486380| |ULTIMATE.start_main_#t~ite44_Out2136486380|) (= ~y$r_buff1_thd0~0_In2136486380 |ULTIMATE.start_main_#t~ite45_Out2136486380|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2136486380, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2136486380, ~weak$$choice2~0=~weak$$choice2~0_In2136486380, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2136486380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2136486380, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In2136486380|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2136486380, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2136486380, ~weak$$choice2~0=~weak$$choice2~0_In2136486380, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2136486380, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2136486380|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2136486380|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2136486380} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:02:52,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:02:52,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:02:52,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:02:52 BasicIcfg [2019-12-27 17:02:52,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:02:52,731 INFO L168 Benchmark]: Toolchain (without parser) took 25772.12 ms. Allocated memory was 145.2 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 101.2 MB in the beginning and 866.0 MB in the end (delta: -764.8 MB). Peak memory consumption was 833.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:52,732 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 17:02:52,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.07 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.8 MB in the beginning and 156.8 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:52,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.99 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:52,734 INFO L168 Benchmark]: Boogie Preprocessor took 43.63 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:52,734 INFO L168 Benchmark]: RCFGBuilder took 786.36 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 104.5 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:52,735 INFO L168 Benchmark]: TraceAbstraction took 24123.46 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 950.5 MB). Free memory was 104.5 MB in the beginning and 866.0 MB in the end (delta: -761.5 MB). Peak memory consumption was 778.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:52,739 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.14 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.07 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.8 MB in the beginning and 156.8 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.99 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.63 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.36 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 104.5 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24123.46 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 950.5 MB). Free memory was 104.5 MB in the beginning and 866.0 MB in the end (delta: -761.5 MB). Peak memory consumption was 778.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L814] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L816] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 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) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 23.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1515 SDtfs, 2459 SDslu, 4604 SDs, 0 SdLazy, 3800 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 31 SyntacticMatches, 28 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22366occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 14641 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 525 ConstructedInterpolants, 0 QuantifiedInterpolants, 114397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...