/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:43:57,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:43:57,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:43:57,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:43:57,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:43:57,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:43:57,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:43:57,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:43:57,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:43:57,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:43:57,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:43:57,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:43:57,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:43:57,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:43:57,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:43:57,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:43:57,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:43:57,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:43:57,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:43:57,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:43:57,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:43:57,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:43:57,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:43:57,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:43:57,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:43:57,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:43:57,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:43:57,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:43:57,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:43:57,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:43:57,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:43:57,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:43:57,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:43:57,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:43:57,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:43:57,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:43:57,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:43:57,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:43:57,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:43:57,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:43:57,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:43:57,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-11-09 16:43:57,805 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:43:57,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:43:57,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:43:57,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:43:57,812 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:43:57,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:43:57,813 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:43:57,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:43:57,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:43:57,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:43:57,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:43:57,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:43:57,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:43:57,816 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:43:57,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:43:57,816 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:43:57,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:43:57,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:43:57,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:43:57,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:43:57,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:43:57,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:43:57,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:43:57,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:43:57,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:43:57,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:43:57,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:43:57,819 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:43:57,819 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:43:57,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:43:57,820 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 16:43:58,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:43:58,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:43:58,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:43:58,363 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:43:58,364 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:43:58,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2020-11-09 16:43:58,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78dcce3b8/0f0a6896c243498d88f864e448f3e6f5/FLAGa9eca1618 [2020-11-09 16:43:59,483 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:43:59,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2020-11-09 16:43:59,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78dcce3b8/0f0a6896c243498d88f864e448f3e6f5/FLAGa9eca1618 [2020-11-09 16:43:59,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78dcce3b8/0f0a6896c243498d88f864e448f3e6f5 [2020-11-09 16:43:59,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:43:59,648 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:43:59,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:43:59,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:43:59,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:43:59,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:43:59" (1/1) ... [2020-11-09 16:43:59,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2004933e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:43:59, skipping insertion in model container [2020-11-09 16:43:59,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:43:59" (1/1) ... [2020-11-09 16:43:59,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:43:59,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:44:00,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:44:00,284 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:44:00,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:44:00,540 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:44:00,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:00 WrapperNode [2020-11-09 16:44:00,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:44:00,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:44:00,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:44:00,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:44:00,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:00" (1/1) ... [2020-11-09 16:44:00,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:00" (1/1) ... [2020-11-09 16:44:00,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:44:00,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:44:00,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:44:00,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:44:00,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:00" (1/1) ... [2020-11-09 16:44:00,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:00" (1/1) ... [2020-11-09 16:44:00,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:00" (1/1) ... [2020-11-09 16:44:00,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:00" (1/1) ... [2020-11-09 16:44:00,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:00" (1/1) ... [2020-11-09 16:44:00,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:00" (1/1) ... [2020-11-09 16:44:00,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:00" (1/1) ... [2020-11-09 16:44:00,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:44:00,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:44:00,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:44:00,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:44:00,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:44:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:44:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 16:44:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:44:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:44:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 16:44:00,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 16:44:00,858 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 16:44:00,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 16:44:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 16:44:00,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 16:44:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:44:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 16:44:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:44:00,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:44:00,862 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 16:44:03,895 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:44:03,896 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 16:44:03,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:03 BoogieIcfgContainer [2020-11-09 16:44:03,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:44:03,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:44:03,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:44:03,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:44:03,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:43:59" (1/3) ... [2020-11-09 16:44:03,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c621f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:03, skipping insertion in model container [2020-11-09 16:44:03,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:00" (2/3) ... [2020-11-09 16:44:03,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c621f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:03, skipping insertion in model container [2020-11-09 16:44:03,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:03" (3/3) ... [2020-11-09 16:44:03,911 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_rmo.opt.i [2020-11-09 16:44:03,931 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:44:03,931 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:44:03,937 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 16:44:03,938 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:44:03,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,984 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,984 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,985 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,985 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,990 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,991 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,991 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,991 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,992 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,992 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,994 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,995 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:03,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,001 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,001 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,001 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,002 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,009 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,010 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,017 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,017 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,022 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,025 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,025 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:04,028 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 16:44:04,042 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 16:44:04,070 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:44:04,070 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:44:04,070 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:44:04,070 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:44:04,070 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:44:04,071 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:44:04,071 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:44:04,071 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:44:04,085 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:44:04,086 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 103 transitions, 221 flow [2020-11-09 16:44:04,090 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 103 transitions, 221 flow [2020-11-09 16:44:04,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 103 transitions, 221 flow [2020-11-09 16:44:04,146 INFO L129 PetriNetUnfolder]: 3/100 cut-off events. [2020-11-09 16:44:04,147 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 16:44:04,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 3/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-11-09 16:44:04,156 INFO L116 LiptonReduction]: Number of co-enabled transitions 1954 [2020-11-09 16:44:04,611 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-11-09 16:44:04,744 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 16:44:04,885 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 16:44:05,106 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 16:44:07,677 WARN L194 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-11-09 16:44:07,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 16:44:07,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:07,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 16:44:07,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:09,391 WARN L194 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-11-09 16:44:12,146 WARN L194 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-11-09 16:44:12,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:12,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:12,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:44:12,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:12,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:12,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:12,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:12,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:44:12,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:44:12,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:44:12,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:44:12,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:44:12,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:12,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:44:12,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:12,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:12,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:12,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:44:12,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:12,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:12,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:12,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:12,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:44:12,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:16,684 WARN L194 SmtUtils]: Spent 4.41 s on a formula simplification. DAG size of input: 354 DAG size of output: 267 [2020-11-09 16:44:18,078 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-11-09 16:44:19,493 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 16:44:19,634 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 16:44:19,772 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 16:44:19,915 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 16:44:20,403 WARN L194 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2020-11-09 16:44:20,647 WARN L194 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-11-09 16:44:21,107 WARN L194 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2020-11-09 16:44:21,325 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-11-09 16:44:21,577 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-09 16:44:21,846 WARN L194 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-09 16:44:22,095 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-09 16:44:22,391 WARN L194 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-09 16:44:22,399 INFO L131 LiptonReduction]: Checked pairs total: 5886 [2020-11-09 16:44:22,399 INFO L133 LiptonReduction]: Total number of compositions: 89 [2020-11-09 16:44:22,410 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-11-09 16:44:22,547 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1332 states. [2020-11-09 16:44:22,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states. [2020-11-09 16:44:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 16:44:22,558 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:44:22,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 16:44:22,561 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:44:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:44:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1053672019, now seen corresponding path program 1 times [2020-11-09 16:44:22,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:44:22,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167786158] [2020-11-09 16:44:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:44:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:44:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:44:22,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167786158] [2020-11-09 16:44:22,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:44:22,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:44:22,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1476778742] [2020-11-09 16:44:22,973 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:44:22,977 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:44:22,990 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 16:44:22,991 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:44:22,996 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:44:22,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:44:22,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:44:23,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:44:23,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:44:23,018 INFO L87 Difference]: Start difference. First operand 1332 states. Second operand 3 states. [2020-11-09 16:44:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:44:23,216 INFO L93 Difference]: Finished difference Result 1112 states and 3605 transitions. [2020-11-09 16:44:23,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:44:23,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 16:44:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:44:23,266 INFO L225 Difference]: With dead ends: 1112 [2020-11-09 16:44:23,266 INFO L226 Difference]: Without dead ends: 812 [2020-11-09 16:44:23,268 INFO L677 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 [2020-11-09 16:44:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-11-09 16:44:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-11-09 16:44:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-11-09 16:44:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2020-11-09 16:44:23,429 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 5 [2020-11-09 16:44:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:44:23,430 INFO L481 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2020-11-09 16:44:23,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:44:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2020-11-09 16:44:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 16:44:23,433 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:44:23,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:44:23,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:44:23,434 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:44:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:44:23,435 INFO L82 PathProgramCache]: Analyzing trace with hash 717561036, now seen corresponding path program 1 times [2020-11-09 16:44:23,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:44:23,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718020990] [2020-11-09 16:44:23,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:44:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:44:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:44:23,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718020990] [2020-11-09 16:44:23,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:44:23,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:44:23,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1434886624] [2020-11-09 16:44:23,618 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:44:23,619 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:44:23,623 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-11-09 16:44:23,623 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:44:23,624 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:44:23,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:44:23,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:44:23,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:44:23,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:44:23,627 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand 3 states. [2020-11-09 16:44:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:44:23,655 INFO L93 Difference]: Finished difference Result 492 states and 1295 transitions. [2020-11-09 16:44:23,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:44:23,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 16:44:23,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:44:23,661 INFO L225 Difference]: With dead ends: 492 [2020-11-09 16:44:23,661 INFO L226 Difference]: Without dead ends: 492 [2020-11-09 16:44:23,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:44:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-11-09 16:44:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2020-11-09 16:44:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2020-11-09 16:44:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1295 transitions. [2020-11-09 16:44:23,692 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1295 transitions. Word has length 10 [2020-11-09 16:44:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:44:23,692 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 1295 transitions. [2020-11-09 16:44:23,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:44:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1295 transitions. [2020-11-09 16:44:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:44:23,695 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:44:23,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:44:23,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:44:23,696 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:44:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:44:23,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1289261239, now seen corresponding path program 1 times [2020-11-09 16:44:23,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:44:23,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853199864] [2020-11-09 16:44:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:44:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:44:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:44:23,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853199864] [2020-11-09 16:44:23,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:44:23,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:44:23,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1188145453] [2020-11-09 16:44:23,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:44:23,852 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:44:23,859 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 46 transitions. [2020-11-09 16:44:23,860 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:44:23,918 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:23,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:23,921 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:23,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:23,925 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:23,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,013 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:24,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,017 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:24,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,020 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:24,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,145 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:24,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,147 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:24,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,152 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:24,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,245 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:24,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,250 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:24,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,253 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:24,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,422 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6999#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:44:24,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:44:24,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:44:24,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:44:24,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:44:24,424 INFO L87 Difference]: Start difference. First operand 492 states and 1295 transitions. Second operand 5 states. [2020-11-09 16:44:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:44:24,462 INFO L93 Difference]: Finished difference Result 268 states and 623 transitions. [2020-11-09 16:44:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:44:24,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 16:44:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:44:24,466 INFO L225 Difference]: With dead ends: 268 [2020-11-09 16:44:24,466 INFO L226 Difference]: Without dead ends: 268 [2020-11-09 16:44:24,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:44:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-11-09 16:44:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2020-11-09 16:44:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-11-09 16:44:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 623 transitions. [2020-11-09 16:44:24,478 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 623 transitions. Word has length 14 [2020-11-09 16:44:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:44:24,478 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 623 transitions. [2020-11-09 16:44:24,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:44:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 623 transitions. [2020-11-09 16:44:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 16:44:24,481 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:44:24,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:44:24,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 16:44:24,482 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:44:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:44:24,482 INFO L82 PathProgramCache]: Analyzing trace with hash -893042836, now seen corresponding path program 1 times [2020-11-09 16:44:24,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:44:24,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878351019] [2020-11-09 16:44:24,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:44:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:44:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:44:24,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878351019] [2020-11-09 16:44:24,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:44:24,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:44:24,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2105076874] [2020-11-09 16:44:24,643 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:44:24,652 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:44:24,669 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 90 transitions. [2020-11-09 16:44:24,670 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:44:24,729 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:24,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,733 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:24,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,734 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:24,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,815 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:24,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,817 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:24,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,820 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:24,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,862 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:24,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,864 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:24,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,865 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:24,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,911 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:24,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,913 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:24,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,914 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:24,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:24,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:24,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,001 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:25,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:25,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,040 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:25,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,041 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:25,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,042 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:25,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,108 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:25,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,110 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:25,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,111 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:25,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,190 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:25,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,192 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:25,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,194 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:25,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,284 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:25,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,287 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:25,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,289 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:25,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,337 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7809#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:44:25,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:44:25,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:44:25,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:44:25,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:44:25,341 INFO L87 Difference]: Start difference. First operand 268 states and 623 transitions. Second operand 6 states. [2020-11-09 16:44:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:44:25,399 INFO L93 Difference]: Finished difference Result 216 states and 519 transitions. [2020-11-09 16:44:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:44:25,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-09 16:44:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:44:25,403 INFO L225 Difference]: With dead ends: 216 [2020-11-09 16:44:25,403 INFO L226 Difference]: Without dead ends: 216 [2020-11-09 16:44:25,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:44:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-11-09 16:44:25,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2020-11-09 16:44:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-11-09 16:44:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 519 transitions. [2020-11-09 16:44:25,413 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 519 transitions. Word has length 18 [2020-11-09 16:44:25,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:44:25,414 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 519 transitions. [2020-11-09 16:44:25,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:44:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 519 transitions. [2020-11-09 16:44:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 16:44:25,416 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:44:25,416 INFO L422 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] [2020-11-09 16:44:25,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:44:25,416 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:44:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:44:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1406324064, now seen corresponding path program 1 times [2020-11-09 16:44:25,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:44:25,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432717624] [2020-11-09 16:44:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:44:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:44:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:44:25,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432717624] [2020-11-09 16:44:25,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:44:25,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:44:25,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1521484503] [2020-11-09 16:44:25,860 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:44:25,867 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:44:25,899 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 133 transitions. [2020-11-09 16:44:25,899 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:44:25,922 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:25,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,924 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:25,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,925 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:25,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,957 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:25,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,959 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:25,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,960 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:25,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,996 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:25,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:25,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:25,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:25,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,041 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:26,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,042 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:26,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,043 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:26,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,122 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:26,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,123 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:26,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,124 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:26,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:26,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,181 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:26,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,182 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:26,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,346 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:26,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,347 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:26,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,349 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:26,349 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,386 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:26,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,388 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:26,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:26,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,425 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:26,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,426 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:26,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,427 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:26,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,465 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:26,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,467 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:26,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,468 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:26,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,548 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:26,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,551 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:26,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,552 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:26,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:26,606 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8466#(and (= ~__unbuffered_p2_EBX~0 1) (= 0 ~x$r_buff0_thd0~0))] [2020-11-09 16:44:26,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 16:44:26,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:44:26,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 16:44:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:44:26,608 INFO L87 Difference]: Start difference. First operand 216 states and 519 transitions. Second operand 9 states. [2020-11-09 16:44:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:44:26,862 INFO L93 Difference]: Finished difference Result 462 states and 1070 transitions. [2020-11-09 16:44:26,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 16:44:26,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-11-09 16:44:26,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:44:26,865 INFO L225 Difference]: With dead ends: 462 [2020-11-09 16:44:26,865 INFO L226 Difference]: Without dead ends: 160 [2020-11-09 16:44:26,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-11-09 16:44:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-09 16:44:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 108. [2020-11-09 16:44:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-09 16:44:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 223 transitions. [2020-11-09 16:44:26,870 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 223 transitions. Word has length 23 [2020-11-09 16:44:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:44:26,870 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 223 transitions. [2020-11-09 16:44:26,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 16:44:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 223 transitions. [2020-11-09 16:44:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 16:44:26,871 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:44:26,871 INFO L422 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] [2020-11-09 16:44:26,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 16:44:26,872 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:44:26,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:44:26,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1392162014, now seen corresponding path program 2 times [2020-11-09 16:44:26,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:44:26,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477205833] [2020-11-09 16:44:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:44:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:44:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:44:27,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477205833] [2020-11-09 16:44:27,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:44:27,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:44:27,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602616815] [2020-11-09 16:44:27,061 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:44:27,068 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:44:27,090 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 59 transitions. [2020-11-09 16:44:27,090 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:44:27,099 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:27,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:27,100 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:27,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:27,102 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:27,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:27,141 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:27,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:27,143 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:27,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:27,144 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:27,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:27,181 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:44:27,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:27,182 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:27,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:27,183 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:27,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:27,307 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:27,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:27,308 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:44:27,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:27,310 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:44:27,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:44:27,408 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:44:27,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:44:27,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:44:27,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:44:27,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:44:27,410 INFO L87 Difference]: Start difference. First operand 108 states and 223 transitions. Second operand 6 states. [2020-11-09 16:44:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:44:27,491 INFO L93 Difference]: Finished difference Result 162 states and 332 transitions. [2020-11-09 16:44:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:44:27,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-11-09 16:44:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:44:27,493 INFO L225 Difference]: With dead ends: 162 [2020-11-09 16:44:27,493 INFO L226 Difference]: Without dead ends: 74 [2020-11-09 16:44:27,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:44:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-09 16:44:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-11-09 16:44:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-09 16:44:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 139 transitions. [2020-11-09 16:44:27,498 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 139 transitions. Word has length 23 [2020-11-09 16:44:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:44:27,498 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 139 transitions. [2020-11-09 16:44:27,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:44:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 139 transitions. [2020-11-09 16:44:27,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 16:44:27,499 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:44:27,499 INFO L422 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] [2020-11-09 16:44:27,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:44:27,499 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:44:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:44:27,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1318142162, now seen corresponding path program 3 times [2020-11-09 16:44:27,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:44:27,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653306813] [2020-11-09 16:44:27,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:44:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:44:27,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:44:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:44:27,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:44:27,828 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 16:44:27,828 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 16:44:27,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 16:44:28,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:44:28 BasicIcfg [2020-11-09 16:44:28,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 16:44:28,016 INFO L168 Benchmark]: Toolchain (without parser) took 28374.20 ms. Allocated memory was 155.2 MB in the beginning and 415.2 MB in the end (delta: 260.0 MB). Free memory was 128.7 MB in the beginning and 330.8 MB in the end (delta: -202.1 MB). Peak memory consumption was 59.0 MB. Max. memory is 8.0 GB. [2020-11-09 16:44:28,017 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 155.2 MB. Free memory is still 126.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:44:28,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 891.49 ms. Allocated memory is still 155.2 MB. Free memory was 128.1 MB in the beginning and 128.5 MB in the end (delta: -381.9 kB). Peak memory consumption was 30.9 MB. Max. memory is 8.0 GB. [2020-11-09 16:44:28,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.84 ms. Allocated memory is still 155.2 MB. Free memory was 128.2 MB in the beginning and 125.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:44:28,019 INFO L168 Benchmark]: Boogie Preprocessor took 54.50 ms. Allocated memory is still 155.2 MB. Free memory was 125.1 MB in the beginning and 123.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:44:28,020 INFO L168 Benchmark]: RCFGBuilder took 3206.29 ms. Allocated memory was 155.2 MB in the beginning and 198.2 MB in the end (delta: 43.0 MB). Free memory was 123.0 MB in the beginning and 119.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 91.9 MB. Max. memory is 8.0 GB. [2020-11-09 16:44:28,021 INFO L168 Benchmark]: TraceAbstraction took 24113.26 ms. Allocated memory was 198.2 MB in the beginning and 415.2 MB in the end (delta: 217.1 MB). Free memory was 118.7 MB in the beginning and 330.8 MB in the end (delta: -212.1 MB). Peak memory consumption was 4.4 MB. Max. memory is 8.0 GB. [2020-11-09 16:44:28,026 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 155.2 MB. Free memory is still 126.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 891.49 ms. Allocated memory is still 155.2 MB. Free memory was 128.1 MB in the beginning and 128.5 MB in the end (delta: -381.9 kB). Peak memory consumption was 30.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 86.84 ms. Allocated memory is still 155.2 MB. Free memory was 128.2 MB in the beginning and 125.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 54.50 ms. Allocated memory is still 155.2 MB. Free memory was 125.1 MB in the beginning and 123.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3206.29 ms. Allocated memory was 155.2 MB in the beginning and 198.2 MB in the end (delta: 43.0 MB). Free memory was 123.0 MB in the beginning and 119.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 91.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24113.26 ms. Allocated memory was 198.2 MB in the beginning and 415.2 MB in the end (delta: 217.1 MB). Free memory was 118.7 MB in the beginning and 330.8 MB in the end (delta: -212.1 MB). Peak memory consumption was 4.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 998 VarBasedMoverChecksPositive, 35 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 89 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 18.3s, 110 PlacesBefore, 39 PlacesAfterwards, 103 TransitionsBefore, 30 TransitionsAfterwards, 1954 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 5886 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t760; [L824] FCALL, FORK 0 pthread_create(&t760, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t761; [L826] FCALL, FORK 0 pthread_create(&t761, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t762; [L828] FCALL, FORK 0 pthread_create(&t762, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L801] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L801] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix028_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.7s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.4s, HoareTripleCheckerStatistics: 160 SDtfs, 201 SDslu, 320 SDs, 0 SdLazy, 102 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1332occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 52 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 9175 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...