/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-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:13:20,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:13:20,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:13:20,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:13:20,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:13:20,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:13:20,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:13:20,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:13:20,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:13:20,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:13:20,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:13:20,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:13:20,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:13:20,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:13:20,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:13:20,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:13:20,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:13:20,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:13:20,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:13:20,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:13:20,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:13:20,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:13:20,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:13:20,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:13:20,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:13:20,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:13:20,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:13:20,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:13:20,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:13:20,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:13:20,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:13:20,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:13:20,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:13:20,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:13:20,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:13:20,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:13:20,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:13:20,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:13:20,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:13:20,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:13:20,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:13:20,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-10-22 02:13:20,901 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:13:20,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:13:20,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:13:20,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:13:20,903 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:13:20,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:13:20,904 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:13:20,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:13:20,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:13:20,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:13:20,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:13:20,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:13:20,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:13:20,906 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:13:20,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:13:20,907 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:13:20,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:13:20,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:13:20,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:13:20,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:13:20,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:13:20,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:13:20,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:13:20,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:13:20,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:13:20,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:13:20,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:13:20,910 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:13:20,910 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:13:20,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:13:20,910 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:13:21,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:13:21,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:13:21,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:13:21,216 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:13:21,216 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:13:21,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i [2020-10-22 02:13:21,285 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b567c542e/339afb7f0ae54fa0b3b22f3bc60d0f1c/FLAG2995d370a [2020-10-22 02:13:21,858 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:13:21,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i [2020-10-22 02:13:21,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b567c542e/339afb7f0ae54fa0b3b22f3bc60d0f1c/FLAG2995d370a [2020-10-22 02:13:22,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b567c542e/339afb7f0ae54fa0b3b22f3bc60d0f1c [2020-10-22 02:13:22,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:13:22,172 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:13:22,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:13:22,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:13:22,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:13:22,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:13:22" (1/1) ... [2020-10-22 02:13:22,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e7e8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22, skipping insertion in model container [2020-10-22 02:13:22,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:13:22" (1/1) ... [2020-10-22 02:13:22,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:13:22,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:13:22,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:13:22,849 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:13:22,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:13:22,999 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:13:23,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22 WrapperNode [2020-10-22 02:13:23,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:13:23,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:13:23,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:13:23,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:13:23,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22" (1/1) ... [2020-10-22 02:13:23,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22" (1/1) ... [2020-10-22 02:13:23,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:13:23,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:13:23,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:13:23,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:13:23,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22" (1/1) ... [2020-10-22 02:13:23,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22" (1/1) ... [2020-10-22 02:13:23,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22" (1/1) ... [2020-10-22 02:13:23,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22" (1/1) ... [2020-10-22 02:13:23,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22" (1/1) ... [2020-10-22 02:13:23,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22" (1/1) ... [2020-10-22 02:13:23,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22" (1/1) ... [2020-10-22 02:13:23,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:13:23,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:13:23,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:13:23,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:13:23,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22" (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-22 02:13:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:13:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:13:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:13:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:13:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:13:23,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:13:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:13:23,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:13:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:13:23,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:13:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:13:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:13:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:13:23,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:13:23,209 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 02:13:25,294 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:13:25,294 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:13:25,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:13:25 BoogieIcfgContainer [2020-10-22 02:13:25,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:13:25,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:13:25,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:13:25,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:13:25,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:13:22" (1/3) ... [2020-10-22 02:13:25,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295ca9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:13:25, skipping insertion in model container [2020-10-22 02:13:25,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:13:22" (2/3) ... [2020-10-22 02:13:25,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295ca9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:13:25, skipping insertion in model container [2020-10-22 02:13:25,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:13:25" (3/3) ... [2020-10-22 02:13:25,306 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_rmo.opt.i [2020-10-22 02:13:25,318 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:13:25,318 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:13:25,326 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:13:25,327 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:13:25,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,359 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,359 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,374 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,375 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,376 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,380 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,380 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:13:25,387 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:13:25,401 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 02:13:25,422 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:13:25,423 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:13:25,423 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:13:25,423 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:13:25,423 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:13:25,423 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:13:25,423 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:13:25,423 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:13:25,438 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:13:25,439 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 102 transitions, 219 flow [2020-10-22 02:13:25,441 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 102 transitions, 219 flow [2020-10-22 02:13:25,444 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 109 places, 102 transitions, 219 flow [2020-10-22 02:13:25,493 INFO L129 PetriNetUnfolder]: 3/99 cut-off events. [2020-10-22 02:13:25,494 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:13:25,499 INFO L80 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 3/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-22 02:13:25,503 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2020-10-22 02:13:26,182 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-22 02:13:27,045 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-10-22 02:13:27,788 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-10-22 02:13:27,966 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-10-22 02:13:28,024 INFO L131 LiptonReduction]: Checked pairs total: 5411 [2020-10-22 02:13:28,024 INFO L133 LiptonReduction]: Total number of compositions: 88 [2020-10-22 02:13:28,032 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-10-22 02:13:28,096 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1124 states. [2020-10-22 02:13:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states. [2020-10-22 02:13:28,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 02:13:28,104 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:13:28,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 02:13:28,106 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:13:28,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:13:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1089496, now seen corresponding path program 1 times [2020-10-22 02:13:28,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:13:28,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263690563] [2020-10-22 02:13:28,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:13:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:13:28,350 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-22 02:13:28,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263690563] [2020-10-22 02:13:28,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:13:28,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:13:28,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [992315158] [2020-10-22 02:13:28,354 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:13:28,356 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:13:28,369 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 02:13:28,369 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:13:28,373 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:13:28,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:13:28,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:13:28,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:13:28,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:13:28,391 INFO L87 Difference]: Start difference. First operand 1124 states. Second operand 3 states. [2020-10-22 02:13:28,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:13:28,487 INFO L93 Difference]: Finished difference Result 937 states and 3000 transitions. [2020-10-22 02:13:28,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:13:28,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 02:13:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:13:28,528 INFO L225 Difference]: With dead ends: 937 [2020-10-22 02:13:28,528 INFO L226 Difference]: Without dead ends: 687 [2020-10-22 02:13:28,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:13:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-22 02:13:28,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-22 02:13:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-22 02:13:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-22 02:13:28,652 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-10-22 02:13:28,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:13:28,653 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-22 02:13:28,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:13:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-22 02:13:28,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:13:28,655 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:13:28,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:13:28,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:13:28,656 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:13:28,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:13:28,656 INFO L82 PathProgramCache]: Analyzing trace with hash -878863549, now seen corresponding path program 1 times [2020-10-22 02:13:28,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:13:28,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782736882] [2020-10-22 02:13:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:13:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:13:28,785 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-22 02:13:28,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782736882] [2020-10-22 02:13:28,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:13:28,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:13:28,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781649427] [2020-10-22 02:13:28,786 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:13:28,789 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:13:28,792 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 02:13:28,792 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:13:28,792 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:13:28,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:13:28,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:13:28,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:13:28,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:13:28,794 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 3 states. [2020-10-22 02:13:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:13:28,818 INFO L93 Difference]: Finished difference Result 431 states and 1126 transitions. [2020-10-22 02:13:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:13:28,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 02:13:28,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:13:28,822 INFO L225 Difference]: With dead ends: 431 [2020-10-22 02:13:28,822 INFO L226 Difference]: Without dead ends: 431 [2020-10-22 02:13:28,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:13:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-22 02:13:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2020-10-22 02:13:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-10-22 02:13:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1126 transitions. [2020-10-22 02:13:28,860 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1126 transitions. Word has length 10 [2020-10-22 02:13:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:13:28,861 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 1126 transitions. [2020-10-22 02:13:28,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:13:28,861 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1126 transitions. [2020-10-22 02:13:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:13:28,864 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:13:28,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:13:28,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:13:28,865 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:13:28,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:13:28,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1275540054, now seen corresponding path program 1 times [2020-10-22 02:13:28,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:13:28,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982378960] [2020-10-22 02:13:28,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:13:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:13:28,978 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-22 02:13:28,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982378960] [2020-10-22 02:13:28,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:13:28,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:13:28,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1557868166] [2020-10-22 02:13:28,979 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:13:28,983 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:13:28,992 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 46 transitions. [2020-10-22 02:13:28,993 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:13:29,361 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:13:29,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:13:29,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:13:29,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:13:29,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:13:29,363 INFO L87 Difference]: Start difference. First operand 431 states and 1126 transitions. Second operand 4 states. [2020-10-22 02:13:29,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:13:29,390 INFO L93 Difference]: Finished difference Result 239 states and 550 transitions. [2020-10-22 02:13:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:13:29,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-22 02:13:29,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:13:29,393 INFO L225 Difference]: With dead ends: 239 [2020-10-22 02:13:29,393 INFO L226 Difference]: Without dead ends: 239 [2020-10-22 02:13:29,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:13:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-10-22 02:13:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2020-10-22 02:13:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-10-22 02:13:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 550 transitions. [2020-10-22 02:13:29,402 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 550 transitions. Word has length 14 [2020-10-22 02:13:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:13:29,402 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 550 transitions. [2020-10-22 02:13:29,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:13:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 550 transitions. [2020-10-22 02:13:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 02:13:29,404 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:13:29,405 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:13:29,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:13:29,405 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:13:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:13:29,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1820184938, now seen corresponding path program 1 times [2020-10-22 02:13:29,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:13:29,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875894375] [2020-10-22 02:13:29,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:13:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:13:29,568 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-22 02:13:29,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875894375] [2020-10-22 02:13:29,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:13:29,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:13:29,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [732169921] [2020-10-22 02:13:29,569 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:13:29,574 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:13:29,587 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 62 transitions. [2020-10-22 02:13:29,588 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:13:29,974 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6696#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:13:29,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:13:29,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:13:29,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:13:29,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:13:29,975 INFO L87 Difference]: Start difference. First operand 239 states and 550 transitions. Second operand 6 states. [2020-10-22 02:13:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:13:30,003 INFO L93 Difference]: Finished difference Result 191 states and 454 transitions. [2020-10-22 02:13:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:13:30,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-22 02:13:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:13:30,005 INFO L225 Difference]: With dead ends: 191 [2020-10-22 02:13:30,005 INFO L226 Difference]: Without dead ends: 191 [2020-10-22 02:13:30,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:13:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-10-22 02:13:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2020-10-22 02:13:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-10-22 02:13:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 454 transitions. [2020-10-22 02:13:30,012 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 454 transitions. Word has length 18 [2020-10-22 02:13:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:13:30,013 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 454 transitions. [2020-10-22 02:13:30,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:13:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 454 transitions. [2020-10-22 02:13:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 02:13:30,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:13:30,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:13:30,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:13:30,015 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:13:30,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:13:30,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1317959231, now seen corresponding path program 1 times [2020-10-22 02:13:30,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:13:30,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440104852] [2020-10-22 02:13:30,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:13:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:13:30,223 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-22 02:13:30,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440104852] [2020-10-22 02:13:30,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:13:30,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:13:30,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1546181113] [2020-10-22 02:13:30,224 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:13:30,230 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:13:30,249 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 79 transitions. [2020-10-22 02:13:30,250 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:13:30,846 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [7277#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (mod ~z$w_buff0_used~0 256) 0))), 7278#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= ~y~0 1))), 7279#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~y~0 0))] [2020-10-22 02:13:30,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-22 02:13:30,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:13:30,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-22 02:13:30,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-22 02:13:30,848 INFO L87 Difference]: Start difference. First operand 191 states and 454 transitions. Second operand 10 states. [2020-10-22 02:13:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:13:31,079 INFO L93 Difference]: Finished difference Result 314 states and 732 transitions. [2020-10-22 02:13:31,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 02:13:31,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-22 02:13:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:13:31,081 INFO L225 Difference]: With dead ends: 314 [2020-10-22 02:13:31,081 INFO L226 Difference]: Without dead ends: 183 [2020-10-22 02:13:31,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-10-22 02:13:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-10-22 02:13:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 151. [2020-10-22 02:13:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-10-22 02:13:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 342 transitions. [2020-10-22 02:13:31,088 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 342 transitions. Word has length 22 [2020-10-22 02:13:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:13:31,088 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 342 transitions. [2020-10-22 02:13:31,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-22 02:13:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 342 transitions. [2020-10-22 02:13:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 02:13:31,090 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:13:31,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:13:31,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:13:31,090 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:13:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:13:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash -822006541, now seen corresponding path program 2 times [2020-10-22 02:13:31,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:13:31,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937858090] [2020-10-22 02:13:31,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:13:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:13:31,333 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-22 02:13:31,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937858090] [2020-10-22 02:13:31,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:13:31,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:13:31,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [664887289] [2020-10-22 02:13:31,335 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:13:31,339 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:13:31,360 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 98 transitions. [2020-10-22 02:13:31,361 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:13:31,543 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 02:13:31,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:31,544 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:13:31,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:31,549 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:13:31,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:31,555 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:13:31,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:31,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:31,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:31,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:31,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:31,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:31,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:31,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:31,618 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:31,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:31,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:31,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:31,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:31,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:31,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:31,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:31,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,771 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:31,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:31,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:13:31,778 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:13:31,783 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:13:31,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:31,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,805 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:13:31,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:31,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:31,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:31,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:31,857 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:31,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:31,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:31,870 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:31,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:31,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:32,776 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 8 [2020-10-22 02:13:32,986 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:13:32,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:13:32,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:13:32,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:13:32,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:13:32,988 INFO L87 Difference]: Start difference. First operand 151 states and 342 transitions. Second operand 7 states. [2020-10-22 02:13:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:13:33,206 INFO L93 Difference]: Finished difference Result 206 states and 459 transitions. [2020-10-22 02:13:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 02:13:33,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-22 02:13:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:13:33,209 INFO L225 Difference]: With dead ends: 206 [2020-10-22 02:13:33,210 INFO L226 Difference]: Without dead ends: 175 [2020-10-22 02:13:33,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-22 02:13:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-10-22 02:13:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 135. [2020-10-22 02:13:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-22 02:13:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 294 transitions. [2020-10-22 02:13:33,218 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 294 transitions. Word has length 22 [2020-10-22 02:13:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:13:33,219 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 294 transitions. [2020-10-22 02:13:33,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:13:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 294 transitions. [2020-10-22 02:13:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 02:13:33,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:13:33,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:13:33,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:13:33,221 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:13:33,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:13:33,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1473150791, now seen corresponding path program 3 times [2020-10-22 02:13:33,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:13:33,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675215138] [2020-10-22 02:13:33,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:13:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:13:33,581 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-22 02:13:33,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675215138] [2020-10-22 02:13:33,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:13:33,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-22 02:13:33,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [584360442] [2020-10-22 02:13:33,582 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:13:33,587 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:13:33,611 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 106 transitions. [2020-10-22 02:13:33,612 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:13:33,995 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:13:33,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:33,997 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:13:33,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:33,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:33,999 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:33,999 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:13:34,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:34,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,006 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:34,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,026 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:34,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,049 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:34,062 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:13:34,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:34,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,068 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:34,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,081 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:13:34,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:34,254 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:13:34,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,256 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:13:34,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,262 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:34,275 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:13:34,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:34,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,285 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:34,304 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:34,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,310 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:34,317 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:13:34,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:34,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,380 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:34,397 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:13:34,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:34,503 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2020-10-22 02:13:34,516 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:13:34,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,521 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:13:34,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,524 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:34,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,531 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:34,545 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:13:34,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:34,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,554 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:34,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,575 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:34,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,593 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:13:34,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:34,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,601 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:34,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,622 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:13:34,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:34,735 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:13:34,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:34,746 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:34,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:34,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:34,759 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:13:34,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:35,437 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2020-10-22 02:13:35,448 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:13:35,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:35,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:35,451 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:35,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:35,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:35,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:35,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:35,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:35,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:35,483 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:35,490 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:13:35,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:35,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:35,536 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:13:35,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:35,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:35,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:35,757 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:13:35,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:35,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:35,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:35,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:35,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:35,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:35,927 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:35,940 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:13:35,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:36,081 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:13:36,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:36,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:36,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:36,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,095 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:36,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:36,103 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:36,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:36,115 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:13:36,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:36,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:36,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:36,151 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:13:36,157 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:13:36,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:36,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,180 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:36,189 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:13:36,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:36,435 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 98 [2020-10-22 02:13:36,445 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:13:36,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:36,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:36,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:36,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,453 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:36,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:36,463 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:36,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:36,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,483 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:36,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,497 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:36,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:36,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:36,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:36,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:36,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,661 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:36,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:36,679 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:13:36,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:13:37,343 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2020-10-22 02:13:37,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,355 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 02:13:37,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,360 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:13:37,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,362 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:13:37,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,363 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,365 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 02:13:37,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,366 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:13:37,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:37,377 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:37,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,383 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:37,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,392 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:37,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:37,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:37,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:37,415 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:13:37,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:37,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:37,432 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:37,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:37,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,441 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 02:13:37,442 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:37,443 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:37,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,457 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:13:37,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:13:37,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,473 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:37,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:13:37,478 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:13:37,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,492 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 02:13:37,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:13:37,616 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [8407#(and (= ~z$r_buff1_thd2~0 0) (or (and (<= ~z$w_buff0_used~0 0) (<= 0 ~z$w_buff0_used~0)) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd1~0 256) 0)))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 8408#(or (and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)))] [2020-10-22 02:13:37,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 02:13:37,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:13:37,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 02:13:37,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-22 02:13:37,618 INFO L87 Difference]: Start difference. First operand 135 states and 294 transitions. Second operand 12 states. [2020-10-22 02:13:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:13:37,801 INFO L93 Difference]: Finished difference Result 156 states and 330 transitions. [2020-10-22 02:13:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:13:37,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-22 02:13:37,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:13:37,803 INFO L225 Difference]: With dead ends: 156 [2020-10-22 02:13:37,803 INFO L226 Difference]: Without dead ends: 111 [2020-10-22 02:13:37,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-22 02:13:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-22 02:13:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-22 02:13:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-22 02:13:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 238 transitions. [2020-10-22 02:13:37,808 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 238 transitions. Word has length 22 [2020-10-22 02:13:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:13:37,808 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 238 transitions. [2020-10-22 02:13:37,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 02:13:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 238 transitions. [2020-10-22 02:13:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 02:13:37,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:13:37,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:13:37,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:13:37,810 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:13:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:13:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1145130535, now seen corresponding path program 4 times [2020-10-22 02:13:37,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:13:37,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604046649] [2020-10-22 02:13:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:13:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:13:37,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:13:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:13:37,922 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:13:37,973 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:13:37,973 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:13:37,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:13:37,999 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-22 02:13:38,000 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [742] [2020-10-22 02:13:38,007 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-22 02:13:38,008 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,009 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-22 02:13:38,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,009 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-22 02:13:38,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,009 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-22 02:13:38,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,010 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-22 02:13:38,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,010 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-22 02:13:38,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,011 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-22 02:13:38,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,011 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-22 02:13:38,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,012 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-22 02:13:38,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,012 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-22 02:13:38,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,013 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-22 02:13:38,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,013 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-22 02:13:38,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,013 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-22 02:13:38,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,014 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-22 02:13:38,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,014 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-22 02:13:38,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,014 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-22 02:13:38,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,017 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-22 02:13:38,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,018 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-22 02:13:38,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,023 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-22 02:13:38,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,023 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-22 02:13:38,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,024 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-22 02:13:38,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,024 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-22 02:13:38,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,024 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-22 02:13:38,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,025 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-22 02:13:38,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,025 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-22 02:13:38,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,025 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-22 02:13:38,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,026 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-22 02:13:38,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,026 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-22 02:13:38,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,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-22 02:13:38,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,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-22 02:13:38,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,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-22 02:13:38,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,028 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-22 02:13:38,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,028 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-22 02:13:38,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:13:38,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:13:38 BasicIcfg [2020-10-22 02:13:38,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:13:38,120 INFO L168 Benchmark]: Toolchain (without parser) took 15952.29 ms. Allocated memory was 140.0 MB in the beginning and 429.4 MB in the end (delta: 289.4 MB). Free memory was 100.6 MB in the beginning and 180.6 MB in the end (delta: -80.0 MB). Peak memory consumption was 209.4 MB. Max. memory is 7.1 GB. [2020-10-22 02:13:38,121 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 02:13:38,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.07 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 156.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-10-22 02:13:38,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.81 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 152.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-22 02:13:38,123 INFO L168 Benchmark]: Boogie Preprocessor took 43.13 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:13:38,124 INFO L168 Benchmark]: RCFGBuilder took 2177.91 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 150.1 MB in the beginning and 159.7 MB in the end (delta: -9.5 MB). Peak memory consumption was 100.8 MB. Max. memory is 7.1 GB. [2020-10-22 02:13:38,125 INFO L168 Benchmark]: TraceAbstraction took 12819.96 ms. Allocated memory was 246.9 MB in the beginning and 429.4 MB in the end (delta: 182.5 MB). Free memory was 159.7 MB in the beginning and 180.6 MB in the end (delta: -20.9 MB). Peak memory consumption was 161.5 MB. Max. memory is 7.1 GB. [2020-10-22 02:13:38,130 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 827.07 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 156.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.81 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 152.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.13 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2177.91 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 150.1 MB in the beginning and 159.7 MB in the end (delta: -9.5 MB). Peak memory consumption was 100.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12819.96 ms. Allocated memory was 246.9 MB in the beginning and 429.4 MB in the end (delta: 182.5 MB). Free memory was 159.7 MB in the beginning and 180.6 MB in the end (delta: -20.9 MB). Peak memory consumption was 161.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 978 VarBasedMoverChecksPositive, 29 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 120 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.5s, 109 PlacesBefore, 38 PlacesAfterwards, 102 TransitionsBefore, 29 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 5411 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1976; [L821] FCALL, FORK 0 pthread_create(&t1976, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t1977; [L823] FCALL, FORK 0 pthread_create(&t1977, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 pthread_t t1978; [L825] FCALL, FORK 0 pthread_create(&t1978, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L792] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L843] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L848] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe008_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.5s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 151 SDtfs, 228 SDslu, 408 SDs, 0 SdLazy, 222 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 128 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1124occurred 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, 72 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 17439 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...