/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi009_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 00:57:25,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 00:57:25,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 00:57:25,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 00:57:25,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 00:57:25,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 00:57:25,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 00:57:25,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 00:57:25,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 00:57:25,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 00:57:25,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 00:57:25,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 00:57:25,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 00:57:25,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 00:57:25,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 00:57:25,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 00:57:25,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 00:57:25,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 00:57:25,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 00:57:25,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 00:57:25,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 00:57:25,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 00:57:25,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 00:57:25,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 00:57:25,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 00:57:25,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 00:57:25,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 00:57:25,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 00:57:25,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 00:57:25,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 00:57:25,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 00:57:25,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 00:57:25,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 00:57:25,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 00:57:25,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 00:57:25,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 00:57:25,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 00:57:25,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 00:57:25,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 00:57:25,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 00:57:25,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 00:57:25,746 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-WP.epf [2020-10-06 00:57:25,789 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 00:57:25,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 00:57:25,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 00:57:25,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 00:57:25,792 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 00:57:25,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 00:57:25,792 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 00:57:25,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 00:57:25,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 00:57:25,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 00:57:25,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 00:57:25,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 00:57:25,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 00:57:25,795 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 00:57:25,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 00:57:25,796 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 00:57:25,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 00:57:25,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 00:57:25,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 00:57:25,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 00:57:25,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 00:57:25,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:57:25,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 00:57:25,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 00:57:25,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 00:57:25,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 00:57:25,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 00:57:25,798 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 00:57:25,798 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 00:57:25,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 00:57:25,799 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 00:57:26,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 00:57:26,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 00:57:26,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 00:57:26,129 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 00:57:26,130 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 00:57:26,130 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_tso.oepc.i [2020-10-06 00:57:26,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818dc17e0/05d0b9cd31d643ab891eb09b653fd1db/FLAGf51ed95ff [2020-10-06 00:57:26,772 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 00:57:26,773 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_tso.oepc.i [2020-10-06 00:57:26,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818dc17e0/05d0b9cd31d643ab891eb09b653fd1db/FLAGf51ed95ff [2020-10-06 00:57:27,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818dc17e0/05d0b9cd31d643ab891eb09b653fd1db [2020-10-06 00:57:27,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 00:57:27,057 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 00:57:27,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 00:57:27,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 00:57:27,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 00:57:27,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:57:27" (1/1) ... [2020-10-06 00:57:27,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b24b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27, skipping insertion in model container [2020-10-06 00:57:27,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:57:27" (1/1) ... [2020-10-06 00:57:27,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 00:57:27,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 00:57:27,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:57:27,729 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 00:57:27,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:57:27,869 INFO L208 MainTranslator]: Completed translation [2020-10-06 00:57:27,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27 WrapperNode [2020-10-06 00:57:27,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 00:57:27,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 00:57:27,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 00:57:27,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 00:57:27,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27" (1/1) ... [2020-10-06 00:57:27,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27" (1/1) ... [2020-10-06 00:57:27,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 00:57:27,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 00:57:27,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 00:57:27,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 00:57:27,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27" (1/1) ... [2020-10-06 00:57:27,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27" (1/1) ... [2020-10-06 00:57:27,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27" (1/1) ... [2020-10-06 00:57:27,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27" (1/1) ... [2020-10-06 00:57:27,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27" (1/1) ... [2020-10-06 00:57:27,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27" (1/1) ... [2020-10-06 00:57:27,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27" (1/1) ... [2020-10-06 00:57:27,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 00:57:27,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 00:57:27,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 00:57:27,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 00:57:27,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:57:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 00:57:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 00:57:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 00:57:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 00:57:28,059 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 00:57:28,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 00:57:28,059 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 00:57:28,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 00:57:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-06 00:57:28,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-06 00:57:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 00:57:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 00:57:28,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 00:57:28,062 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 00:57:30,680 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 00:57:30,681 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 00:57:30,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:57:30 BoogieIcfgContainer [2020-10-06 00:57:30,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 00:57:30,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 00:57:30,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 00:57:30,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 00:57:30,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 12:57:27" (1/3) ... [2020-10-06 00:57:30,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f885b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:57:30, skipping insertion in model container [2020-10-06 00:57:30,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:57:27" (2/3) ... [2020-10-06 00:57:30,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f885b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:57:30, skipping insertion in model container [2020-10-06 00:57:30,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:57:30" (3/3) ... [2020-10-06 00:57:30,693 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi009_tso.oepc.i [2020-10-06 00:57:30,704 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 00:57:30,704 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 00:57:30,716 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 00:57:30,717 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 00:57:30,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,773 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,773 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,832 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,832 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,854 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,854 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,871 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,872 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,876 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,876 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,883 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,883 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,883 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,883 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,883 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,884 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,885 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,887 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:57:30,904 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-06 00:57:30,928 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 00:57:30,928 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 00:57:30,929 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 00:57:30,929 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 00:57:30,929 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 00:57:30,929 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 00:57:30,929 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 00:57:30,929 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 00:57:30,954 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-06 00:57:30,956 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-06 00:57:31,005 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-06 00:57:31,006 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:57:31,011 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-06 00:57:31,015 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-06 00:57:31,038 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-06 00:57:31,038 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:57:31,039 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-06 00:57:31,041 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1548 [2020-10-06 00:57:31,042 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 00:57:31,640 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-06 00:57:31,764 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-06 00:57:33,335 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2020-10-06 00:57:33,588 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-10-06 00:57:33,704 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-06 00:57:33,719 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3735 [2020-10-06 00:57:33,719 INFO L214 etLargeBlockEncoding]: Total number of compositions: 77 [2020-10-06 00:57:33,723 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-06 00:57:33,763 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 626 states. [2020-10-06 00:57:33,766 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states. [2020-10-06 00:57:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-06 00:57:33,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:57:33,774 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-06 00:57:33,774 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:57:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:57:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1223890449, now seen corresponding path program 1 times [2020-10-06 00:57:33,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:57:33,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670809015] [2020-10-06 00:57:33,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:57:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:57:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:57:34,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670809015] [2020-10-06 00:57:34,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:57:34,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:57:34,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1970294093] [2020-10-06 00:57:34,047 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:57:34,050 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:57:34,063 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-06 00:57:34,063 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:57:34,067 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:57:34,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:57:34,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:57:34,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:57:34,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:57:34,086 INFO L87 Difference]: Start difference. First operand 626 states. Second operand 3 states. [2020-10-06 00:57:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:57:34,195 INFO L93 Difference]: Finished difference Result 538 states and 1644 transitions. [2020-10-06 00:57:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:57:34,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-06 00:57:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:57:34,215 INFO L225 Difference]: With dead ends: 538 [2020-10-06 00:57:34,215 INFO L226 Difference]: Without dead ends: 442 [2020-10-06 00:57:34,217 INFO L675 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-10-06 00:57:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-06 00:57:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-10-06 00:57:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-06 00:57:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1324 transitions. [2020-10-06 00:57:34,302 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1324 transitions. Word has length 5 [2020-10-06 00:57:34,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:57:34,303 INFO L479 AbstractCegarLoop]: Abstraction has 442 states and 1324 transitions. [2020-10-06 00:57:34,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:57:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1324 transitions. [2020-10-06 00:57:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 00:57:34,305 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:57:34,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:57:34,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 00:57:34,306 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:57:34,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:57:34,306 INFO L82 PathProgramCache]: Analyzing trace with hash -779238090, now seen corresponding path program 1 times [2020-10-06 00:57:34,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:57:34,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423086460] [2020-10-06 00:57:34,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:57:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:57:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:57:34,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423086460] [2020-10-06 00:57:34,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:57:34,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:57:34,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [559447234] [2020-10-06 00:57:34,451 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:57:34,452 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:57:34,454 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 00:57:34,454 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:57:34,454 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:57:34,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:57:34,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:57:34,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:57:34,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:57:34,457 INFO L87 Difference]: Start difference. First operand 442 states and 1324 transitions. Second operand 3 states. [2020-10-06 00:57:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:57:34,472 INFO L93 Difference]: Finished difference Result 410 states and 1212 transitions. [2020-10-06 00:57:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:57:34,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-06 00:57:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:57:34,480 INFO L225 Difference]: With dead ends: 410 [2020-10-06 00:57:34,481 INFO L226 Difference]: Without dead ends: 410 [2020-10-06 00:57:34,482 INFO L675 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-10-06 00:57:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-10-06 00:57:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2020-10-06 00:57:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-06 00:57:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1212 transitions. [2020-10-06 00:57:34,511 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1212 transitions. Word has length 9 [2020-10-06 00:57:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:57:34,512 INFO L479 AbstractCegarLoop]: Abstraction has 410 states and 1212 transitions. [2020-10-06 00:57:34,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:57:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1212 transitions. [2020-10-06 00:57:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:57:34,515 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:57:34,515 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:57:34,515 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 00:57:34,515 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:57:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:57:34,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1591213561, now seen corresponding path program 1 times [2020-10-06 00:57:34,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:57:34,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297692827] [2020-10-06 00:57:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:57:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:57:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:57:34,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297692827] [2020-10-06 00:57:34,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:57:34,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:57:34,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1655936651] [2020-10-06 00:57:34,604 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:57:34,609 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:57:34,613 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-10-06 00:57:34,613 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:57:34,785 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:57:34,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:57:34,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:57:34,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:57:34,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:57:34,787 INFO L87 Difference]: Start difference. First operand 410 states and 1212 transitions. Second operand 3 states. [2020-10-06 00:57:34,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:57:34,797 INFO L93 Difference]: Finished difference Result 394 states and 1156 transitions. [2020-10-06 00:57:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:57:34,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-06 00:57:34,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:57:34,802 INFO L225 Difference]: With dead ends: 394 [2020-10-06 00:57:34,802 INFO L226 Difference]: Without dead ends: 394 [2020-10-06 00:57:34,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-10-06 00:57:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-10-06 00:57:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2020-10-06 00:57:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-10-06 00:57:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1156 transitions. [2020-10-06 00:57:34,822 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1156 transitions. Word has length 11 [2020-10-06 00:57:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:57:34,823 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1156 transitions. [2020-10-06 00:57:34,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:57:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1156 transitions. [2020-10-06 00:57:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 00:57:34,825 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:57:34,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:57:34,826 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 00:57:34,826 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:57:34,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:57:34,826 INFO L82 PathProgramCache]: Analyzing trace with hash 857963901, now seen corresponding path program 1 times [2020-10-06 00:57:34,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:57:34,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497874404] [2020-10-06 00:57:34,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:57:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:57:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:57:34,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497874404] [2020-10-06 00:57:34,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:57:34,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:57:34,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1768432420] [2020-10-06 00:57:34,935 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:57:34,937 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:57:34,985 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 58 transitions. [2020-10-06 00:57:34,985 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:57:35,245 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:57:35,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:57:35,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:57:35,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:57:35,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:57:35,247 INFO L87 Difference]: Start difference. First operand 394 states and 1156 transitions. Second operand 4 states. [2020-10-06 00:57:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:57:35,278 INFO L93 Difference]: Finished difference Result 544 states and 1574 transitions. [2020-10-06 00:57:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:57:35,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-06 00:57:35,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:57:35,282 INFO L225 Difference]: With dead ends: 544 [2020-10-06 00:57:35,282 INFO L226 Difference]: Without dead ends: 286 [2020-10-06 00:57:35,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:57:35,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-10-06 00:57:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2020-10-06 00:57:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-10-06 00:57:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 812 transitions. [2020-10-06 00:57:35,294 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 812 transitions. Word has length 12 [2020-10-06 00:57:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:57:35,294 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 812 transitions. [2020-10-06 00:57:35,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:57:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 812 transitions. [2020-10-06 00:57:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:57:35,297 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:57:35,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:57:35,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 00:57:35,297 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:57:35,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:57:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash -147890731, now seen corresponding path program 1 times [2020-10-06 00:57:35,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:57:35,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990018255] [2020-10-06 00:57:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:57:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:57:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:57:35,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990018255] [2020-10-06 00:57:35,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:57:35,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:57:35,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1973656780] [2020-10-06 00:57:35,445 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:57:35,448 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:57:35,458 INFO L258 McrAutomatonBuilder]: Finished intersection with 32 states and 53 transitions. [2020-10-06 00:57:35,458 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:57:35,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:57:35,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:57:35,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:57:35,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:57:35,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:57:35,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:57:35,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:57:35,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:57:35,737 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6325#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-06 00:57:35,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:57:35,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:57:35,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:57:35,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:57:35,739 INFO L87 Difference]: Start difference. First operand 286 states and 812 transitions. Second operand 5 states. [2020-10-06 00:57:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:57:35,807 INFO L93 Difference]: Finished difference Result 202 states and 496 transitions. [2020-10-06 00:57:35,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:57:35,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-06 00:57:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:57:35,809 INFO L225 Difference]: With dead ends: 202 [2020-10-06 00:57:35,809 INFO L226 Difference]: Without dead ends: 124 [2020-10-06 00:57:35,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:57:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-06 00:57:35,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2020-10-06 00:57:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-06 00:57:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 256 transitions. [2020-10-06 00:57:35,814 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 256 transitions. Word has length 13 [2020-10-06 00:57:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:57:35,814 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 256 transitions. [2020-10-06 00:57:35,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:57:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 256 transitions. [2020-10-06 00:57:35,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 00:57:35,816 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:57:35,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:57:35,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 00:57:35,816 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:57:35,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:57:35,817 INFO L82 PathProgramCache]: Analyzing trace with hash 526114945, now seen corresponding path program 1 times [2020-10-06 00:57:35,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:57:35,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769573343] [2020-10-06 00:57:35,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:57:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:57:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:57:36,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769573343] [2020-10-06 00:57:36,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:57:36,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:57:36,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [140039056] [2020-10-06 00:57:36,032 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:57:36,037 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:57:36,059 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 39 transitions. [2020-10-06 00:57:36,060 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:57:36,218 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6786#(<= ~__unbuffered_cnt~0 0)] [2020-10-06 00:57:36,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:57:36,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:57:36,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:57:36,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:57:36,219 INFO L87 Difference]: Start difference. First operand 124 states and 256 transitions. Second operand 7 states. [2020-10-06 00:57:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:57:36,283 INFO L93 Difference]: Finished difference Result 108 states and 222 transitions. [2020-10-06 00:57:36,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:57:36,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-06 00:57:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:57:36,285 INFO L225 Difference]: With dead ends: 108 [2020-10-06 00:57:36,285 INFO L226 Difference]: Without dead ends: 97 [2020-10-06 00:57:36,286 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:57:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-06 00:57:36,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-06 00:57:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-06 00:57:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 202 transitions. [2020-10-06 00:57:36,289 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 202 transitions. Word has length 17 [2020-10-06 00:57:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:57:36,290 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 202 transitions. [2020-10-06 00:57:36,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:57:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 202 transitions. [2020-10-06 00:57:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 00:57:36,292 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:57:36,292 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] [2020-10-06 00:57:36,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 00:57:36,292 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:57:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:57:36,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1418241365, now seen corresponding path program 1 times [2020-10-06 00:57:36,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:57:36,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127506226] [2020-10-06 00:57:36,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:57:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:57:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:57:36,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127506226] [2020-10-06 00:57:36,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:57:36,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 00:57:36,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1663489985] [2020-10-06 00:57:36,890 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:57:36,897 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:57:36,922 INFO L258 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions. [2020-10-06 00:57:36,923 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:57:37,014 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-06 00:57:37,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,016 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,019 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,025 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,028 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,029 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,032 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-06 00:57:37,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,034 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,035 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:37,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:37,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:37,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:37,282 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-06 00:57:37,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,283 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,284 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,285 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-06 00:57:37,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,286 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,287 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,289 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,291 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,293 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:57:37,293 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:57:37,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:37,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:37,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:37,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:37,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:37,546 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-06 00:57:37,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,547 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-06 00:57:37,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,550 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:57:37,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,552 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:57:37,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,555 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-06 00:57:37,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,749 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-10-06 00:57:37,762 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:57:37,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,766 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:57:37,769 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,770 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-06 00:57:37,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,775 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-06 00:57:37,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,776 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-06 00:57:37,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,811 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:57:37,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,814 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:57:37,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,816 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-06 00:57:37,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,820 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-06 00:57:37,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,820 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-06 00:57:37,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,855 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-06 00:57:37,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,856 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 2, 1] term [2020-10-06 00:57:37,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,858 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:57:37,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:37,859 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 4, 2, 2, 2, 1] term [2020-10-06 00:57:37,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:57:37,860 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 00:57:37,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,310 WARN L193 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 50 [2020-10-06 00:57:38,314 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:57:38,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,315 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:57:38,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,318 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:57:38,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,319 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:57:38,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,320 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-06 00:57:38,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,488 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 35 [2020-10-06 00:57:38,494 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:57:38,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,495 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:57:38,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,496 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-06 00:57:38,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,498 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:57:38,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,499 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:57:38,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,581 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 2, 1] term [2020-10-06 00:57:38,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:57:38,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,593 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:57:38,594 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-06 00:57:38,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,596 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:57:38,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:57:38,598 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:57:38,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,602 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2020-10-06 00:57:38,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,603 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2020-10-06 00:57:38,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,604 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2020-10-06 00:57:38,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,606 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2020-10-06 00:57:38,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,607 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2020-10-06 00:57:38,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,609 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2020-10-06 00:57:38,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,610 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2020-10-06 00:57:38,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,612 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:38,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:38,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,616 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:38,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,617 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:38,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:38,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,621 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:38,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,623 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:38,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,624 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:38,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:38,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:57:38,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:38,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:38,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:38,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:38,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:39,874 WARN L193 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 45 [2020-10-06 00:57:39,889 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:57:39,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,890 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:57:39,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,892 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:57:39,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,893 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:57:39,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,894 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-06 00:57:39,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,978 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 2, 1] term [2020-10-06 00:57:39,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:57:39,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,982 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:57:39,983 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-06 00:57:39,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,984 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:57:39,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:57:39,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,987 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:57:39,989 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:39,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,990 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:39,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,991 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:39,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,993 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 1] term [2020-10-06 00:57:39,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,994 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 1] term [2020-10-06 00:57:39,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,996 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 1] term [2020-10-06 00:57:39,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:39,997 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 1] term [2020-10-06 00:57:39,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:40,000 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:40,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:40,001 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-10-06 00:57:40,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:40,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 3, 3, 1] term [2020-10-06 00:57:40,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:40,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 3, 3, 1] term [2020-10-06 00:57:40,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:40,007 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 3, 3, 1] term [2020-10-06 00:57:40,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:40,008 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 3, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 3, 4, 3, 3, 1] term [2020-10-06 00:57:40,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:40,010 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 3, 4, 3, 3, 1] term [2020-10-06 00:57:40,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:40,011 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 3, 4, 3, 3, 1] term [2020-10-06 00:57:40,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:40,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:57:40,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:57:40,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:40,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:40,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:40,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:40,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:57:40,510 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [7099#(or (and (or (and (or (= (mod ~y$r_buff1_thd3~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0)) (not (= ~y~0 0))) (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0)))) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)) (= ~__unbuffered_p1_EAX~0 0)), 7100#(or (and (or (= 0 (mod ~y$r_buff1_thd2~0 256)) (and (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))) (= (mod ~y$w_buff1_used~0 256) 0) (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0)))) (or (= (mod ~y$r_buff0_thd2~0 256) 0) (and (or (= (mod ~y$r_buff1_thd3~0 256) 0) (not (= 0 (mod ~y$r_buff1_thd2~0 256))) (= (mod ~y$w_buff1_used~0 256) 0)) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0))) (or (and (or (and (or (= (mod ~y$r_buff1_thd3~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0)) (not (= ~y~0 0))) (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0)))) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)) (and (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))))) (= ~__unbuffered_p1_EAX~0 0)), 7101#(or (and (or (and (or (= 0 (mod ~y$r_buff1_thd2~0 256)) (= (mod ~y$w_buff1_used~0 256) 0)) (not (= ~y~0 0))) (and (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0)))) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)) (= ~__unbuffered_p1_EAX~0 0)), 7102#(and (or (= ~y$r_buff1_thd3~0 0) (and (or (and (= (mod ~y$r_buff0_thd2~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0)) (= (mod ~y$w_buff0_used~0 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0 256)) (= (mod ~y$r_buff0_thd2~0 256) 0)) (and (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y$w_buff0~0 0))) (or (= ~y~0 0) (and (or (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (or (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= 0 (mod ~y$r_buff1_thd2~0 256)))) (not (= (mod ~y$w_buff0_used~0 256) 0)))))) (or (= 0 (mod ~y$r_buff1_thd2~0 256)) (= ~y~0 0) (and (or (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (or (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= 0 (mod ~y$r_buff1_thd2~0 256)))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (= (mod ~y$w_buff1_used~0 256) 0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= 0 (mod ~y$r_buff1_thd2~0 256)) (= ~y$w_buff0~0 0) (= (mod ~y$w_buff1_used~0 256) 0)) (or (and (or (and (= (mod ~y$r_buff0_thd2~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0)) (= (mod ~y$w_buff0_used~0 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0 256)) (= (mod ~y$r_buff0_thd2~0 256) 0)) (and (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y$w_buff0~0 0))) (or (= ~y~0 0) (and (or (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (or (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= 0 (mod ~y$r_buff1_thd2~0 256)))) (not (= (mod ~y$w_buff0_used~0 256) 0))))) (= ~y$r_buff1_thd1~0 0)) (or (and (or (and (= (mod ~y$r_buff0_thd2~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0)) (= (mod ~y$w_buff0_used~0 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0 256)) (= (mod ~y$r_buff0_thd2~0 256) 0)) (and (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y$w_buff0~0 0))) (or (= ~y~0 0) (and (or (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (or (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= 0 (mod ~y$r_buff1_thd2~0 256)))) (not (= (mod ~y$w_buff0_used~0 256) 0))))) (= ~y$w_buff0~0 1))), 7103#(or (not (= (mod ~y$w_buff0_used~0 256) 0)) (and (= ~y$r_buff0_thd1~0 0) (= ~y$r_buff0_thd3~0 0)))] [2020-10-06 00:57:40,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-06 00:57:40,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:57:40,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-06 00:57:40,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-10-06 00:57:40,512 INFO L87 Difference]: Start difference. First operand 97 states and 202 transitions. Second operand 13 states. [2020-10-06 00:57:40,646 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 24 [2020-10-06 00:57:40,996 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2020-10-06 00:57:41,263 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2020-10-06 00:57:41,599 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2020-10-06 00:57:41,957 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2020-10-06 00:57:42,284 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-10-06 00:57:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:57:42,718 INFO L93 Difference]: Finished difference Result 167 states and 337 transitions. [2020-10-06 00:57:42,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-06 00:57:42,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2020-10-06 00:57:42,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:57:42,720 INFO L225 Difference]: With dead ends: 167 [2020-10-06 00:57:42,720 INFO L226 Difference]: Without dead ends: 127 [2020-10-06 00:57:42,721 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2020-10-06 00:57:42,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-06 00:57:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 79. [2020-10-06 00:57:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-06 00:57:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 158 transitions. [2020-10-06 00:57:42,725 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 158 transitions. Word has length 20 [2020-10-06 00:57:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:57:42,725 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 158 transitions. [2020-10-06 00:57:42,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-06 00:57:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 158 transitions. [2020-10-06 00:57:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 00:57:42,726 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:57:42,726 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] [2020-10-06 00:57:42,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 00:57:42,727 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:57:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:57:42,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1910142059, now seen corresponding path program 2 times [2020-10-06 00:57:42,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:57:42,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152758184] [2020-10-06 00:57:42,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:57:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:57:42,862 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:57:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:57:42,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:57:42,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 00:57:42,999 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 00:57:42,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 00:57:43,000 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 00:57:43,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1234] [1234] L4-->L849: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In384909099 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In384909099 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In384909099 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In384909099 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (or (and .cse0 .cse1 (= ~y$w_buff0~0_In384909099 ~y~0_Out384909099)) (and .cse2 (or (and (= ~y~0_Out384909099 ~y$w_buff1~0_In384909099) .cse3 .cse4) (and (= ~y~0_Out384909099 ~y~0_In384909099) .cse5)))) (= ~y$r_buff0_thd0~0_Out384909099 ~y$r_buff0_thd0~0_In384909099) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In384909099 0)) (or (and (= ~y$w_buff0_used~0_In384909099 ~y$w_buff0_used~0_Out384909099) .cse2) (and .cse0 (= ~y$w_buff0_used~0_Out384909099 0) .cse1)) (or (and (= ~y$w_buff1_used~0_Out384909099 0) .cse3 .cse4) (and .cse5 (= ~y$w_buff1_used~0_In384909099 ~y$w_buff1_used~0_Out384909099))) (= ~y$r_buff1_thd0~0_Out384909099 ~y$r_buff1_thd0~0_In384909099)))) InVars {ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In384909099, ~y$w_buff0_used~0=~y$w_buff0_used~0_In384909099, ~y$w_buff1~0=~y$w_buff1~0_In384909099, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In384909099, ~y$w_buff0~0=~y$w_buff0~0_In384909099, ~y~0=~y~0_In384909099, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In384909099, ~y$w_buff1_used~0=~y$w_buff1_used~0_In384909099} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out384909099, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out384909099|, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out384909099|, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out384909099|, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out384909099|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out384909099|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out384909099|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In384909099, ~y$w_buff1~0=~y$w_buff1~0_In384909099, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out384909099, ~y$w_buff0~0=~y$w_buff0~0_In384909099, ~y~0=~y~0_Out384909099, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out384909099, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out384909099} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ~y~0, ULTIMATE.start_main_#t~ite67, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-06 00:57:43,027 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,031 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,032 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,032 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,032 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,033 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,033 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,035 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,045 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,045 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,045 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:57:43,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:57:43,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 12:57:43 BasicIcfg [2020-10-06 00:57:43,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 00:57:43,113 INFO L168 Benchmark]: Toolchain (without parser) took 16054.02 ms. Allocated memory was 138.4 MB in the beginning and 467.7 MB in the end (delta: 329.3 MB). Free memory was 100.2 MB in the beginning and 94.2 MB in the end (delta: 5.9 MB). Peak memory consumption was 335.2 MB. Max. memory is 7.1 GB. [2020-10-06 00:57:43,114 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-06 00:57:43,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.19 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 100.0 MB in the beginning and 156.9 MB in the end (delta: -57.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2020-10-06 00:57:43,116 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.15 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 153.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-06 00:57:43,117 INFO L168 Benchmark]: Boogie Preprocessor took 48.38 ms. Allocated memory is still 203.4 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-06 00:57:43,118 INFO L168 Benchmark]: RCFGBuilder took 2690.85 ms. Allocated memory was 203.4 MB in the beginning and 249.6 MB in the end (delta: 46.1 MB). Free memory was 150.8 MB in the beginning and 98.3 MB in the end (delta: 52.5 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. [2020-10-06 00:57:43,118 INFO L168 Benchmark]: TraceAbstraction took 12423.39 ms. Allocated memory was 249.6 MB in the beginning and 467.7 MB in the end (delta: 218.1 MB). Free memory was 98.3 MB in the beginning and 94.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 222.1 MB. Max. memory is 7.1 GB. [2020-10-06 00:57:43,123 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.19 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 100.0 MB in the beginning and 156.9 MB in the end (delta: -57.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.15 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 153.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.38 ms. Allocated memory is still 203.4 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2690.85 ms. Allocated memory was 203.4 MB in the beginning and 249.6 MB in the end (delta: 46.1 MB). Free memory was 150.8 MB in the beginning and 98.3 MB in the end (delta: 52.5 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12423.39 ms. Allocated memory was 249.6 MB in the beginning and 467.7 MB in the end (delta: 218.1 MB). Free memory was 98.3 MB in the beginning and 94.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 222.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 101 ProgramPointsBefore, 35 ProgramPointsAfterwards, 93 TransitionsBefore, 25 TransitionsAfterwards, 1548 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 765 VarBasedMoverChecksPositive, 28 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3735 CheckedPairsTotal, 77 TotalNumberOfCompositions - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p0_EBX = 0; [L705] 0 int __unbuffered_p1_EAX = 0; [L707] 0 int __unbuffered_p1_EBX = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L713] 0 int y = 0; [L714] 0 _Bool y$flush_delayed; [L715] 0 int y$mem_tmp; [L716] 0 _Bool y$r_buff0_thd0; [L717] 0 _Bool y$r_buff0_thd1; [L718] 0 _Bool y$r_buff0_thd2; [L719] 0 _Bool y$r_buff0_thd3; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$r_buff1_thd3; [L724] 0 _Bool y$read_delayed; [L725] 0 int *y$read_delayed_var; [L726] 0 int y$w_buff0; [L727] 0 _Bool y$w_buff0_used; [L728] 0 int y$w_buff1; [L729] 0 _Bool y$w_buff1_used; [L730] 0 _Bool weak$$choice0; [L731] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1755; [L834] FCALL, FORK 0 pthread_create(&t1755, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 pthread_t t1756; [L836] FCALL, FORK 0 pthread_create(&t1756, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1 = y$w_buff0 [L764] 2 y$w_buff0 = 1 [L765] 2 y$w_buff1_used = y$w_buff0_used [L766] 2 y$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L784] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = y [L787] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 pthread_t t1757; [L838] FCALL, FORK 0 pthread_create(&t1757, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L735] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L739] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L740] 1 y$flush_delayed = weak$$choice2 [L741] 1 y$mem_tmp = y [L742] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L742] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L742] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L743] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L743] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L744] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L744] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L745] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L745] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L746] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L747] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L747] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L748] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] 1 __unbuffered_p0_EBX = y [L750] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L750] 1 y = y$flush_delayed ? y$mem_tmp : y [L751] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.0s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 146 SDtfs, 251 SDslu, 315 SDs, 0 SdLazy, 172 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 14 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=626occurred 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, 7 MinimizatonAttempts, 48 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 9122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...