/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:00:22,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:00:22,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:00:22,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:00:22,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:00:22,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:00:22,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:00:22,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:00:22,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:00:22,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:00:22,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:00:22,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:00:22,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:00:22,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:00:22,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:00:22,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:00:22,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:00:22,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:00:22,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:00:22,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:00:22,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:00:22,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:00:22,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:00:22,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:00:22,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:00:22,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:00:22,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:00:22,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:00:22,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:00:22,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:00:22,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:00:22,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:00:22,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:00:22,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:00:22,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:00:22,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:00:22,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:00:22,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:00:22,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:00:22,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:00:22,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:00:22,237 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.epf [2020-10-21 23:00:22,261 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:00:22,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:00:22,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:00:22,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:00:22,263 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:00:22,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:00:22,263 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:00:22,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:00:22,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:00:22,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:00:22,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:00:22,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:00:22,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:00:22,265 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:00:22,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:00:22,265 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:00:22,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:00:22,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:00:22,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:00:22,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:00:22,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:00:22,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:00:22,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:00:22,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:00:22,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:00:22,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:00:22,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:00:22,268 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:00:22,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:00:22,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:00:22,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:00:22,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:00:22,608 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:00:22,609 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:00:22,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2020-10-21 23:00:22,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf77e6bf6/13b883527a5d4c00b0bd038dbc086d19/FLAGd97c7554c [2020-10-21 23:00:23,175 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:00:23,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2020-10-21 23:00:23,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf77e6bf6/13b883527a5d4c00b0bd038dbc086d19/FLAGd97c7554c [2020-10-21 23:00:23,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf77e6bf6/13b883527a5d4c00b0bd038dbc086d19 [2020-10-21 23:00:23,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:00:23,525 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:00:23,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:00:23,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:00:23,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:00:23,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:00:23" (1/1) ... [2020-10-21 23:00:23,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331b4df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:23, skipping insertion in model container [2020-10-21 23:00:23,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:00:23" (1/1) ... [2020-10-21 23:00:23,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:00:23,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:00:24,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:00:24,312 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:00:24,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:00:24,490 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:00:24,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:24 WrapperNode [2020-10-21 23:00:24,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:00:24,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:00:24,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:00:24,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:00:24,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:24" (1/1) ... [2020-10-21 23:00:24,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:24" (1/1) ... [2020-10-21 23:00:24,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:00:24,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:00:24,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:00:24,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:00:24,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:24" (1/1) ... [2020-10-21 23:00:24,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:24" (1/1) ... [2020-10-21 23:00:24,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:24" (1/1) ... [2020-10-21 23:00:24,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:24" (1/1) ... [2020-10-21 23:00:24,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:24" (1/1) ... [2020-10-21 23:00:24,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:24" (1/1) ... [2020-10-21 23:00:24,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:24" (1/1) ... [2020-10-21 23:00:24,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:00:24,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:00:24,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:00:24,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:00:24,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:24" (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-21 23:00:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:00:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:00:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:00:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:00:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:00:24,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:00:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:00:24,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:00:24,680 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:00:24,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:00:24,680 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 23:00:24,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 23:00:24,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:00:24,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:00:24,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:00:24,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:00:24,684 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:00:26,864 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:00:26,864 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:00:26,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:00:26 BoogieIcfgContainer [2020-10-21 23:00:26,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:00:26,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:00:26,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:00:26,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:00:26,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:00:23" (1/3) ... [2020-10-21 23:00:26,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e56ae24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:00:26, skipping insertion in model container [2020-10-21 23:00:26,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:24" (2/3) ... [2020-10-21 23:00:26,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e56ae24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:00:26, skipping insertion in model container [2020-10-21 23:00:26,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:00:26" (3/3) ... [2020-10-21 23:00:26,879 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i [2020-10-21 23:00:26,892 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:00:26,892 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:00:26,902 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:00:26,904 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:00:26,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,954 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,954 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,956 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,956 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,960 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,960 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,960 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,963 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,973 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,974 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,977 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,978 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,980 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,984 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,986 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,986 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:26,988 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:00:27,002 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 23:00:27,026 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:00:27,027 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:00:27,027 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:00:27,027 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:00:27,027 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:00:27,027 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:00:27,027 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:00:27,028 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:00:27,048 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:00:27,049 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-10-21 23:00:27,052 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-10-21 23:00:27,055 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-10-21 23:00:27,160 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-10-21 23:00:27,160 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:00:27,169 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-10-21 23:00:27,179 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-10-21 23:00:27,725 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-10-21 23:00:28,846 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-21 23:00:29,835 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-21 23:00:29,960 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-21 23:00:30,435 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-10-21 23:00:30,637 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-21 23:00:30,668 INFO L131 LiptonReduction]: Checked pairs total: 8162 [2020-10-21 23:00:30,669 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-10-21 23:00:30,675 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2020-10-21 23:00:31,080 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4122 states. [2020-10-21 23:00:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states. [2020-10-21 23:00:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:00:31,113 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:31,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:31,117 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:31,125 INFO L82 PathProgramCache]: Analyzing trace with hash 284962156, now seen corresponding path program 1 times [2020-10-21 23:00:31,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:31,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305822684] [2020-10-21 23:00:31,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:31,442 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-21 23:00:31,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305822684] [2020-10-21 23:00:31,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:31,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:00:31,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371433745] [2020-10-21 23:00:31,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:00:31,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:31,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:00:31,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:00:31,469 INFO L87 Difference]: Start difference. First operand 4122 states. Second operand 3 states. [2020-10-21 23:00:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:31,609 INFO L93 Difference]: Finished difference Result 3562 states and 14032 transitions. [2020-10-21 23:00:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:00:31,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:00:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:31,661 INFO L225 Difference]: With dead ends: 3562 [2020-10-21 23:00:31,661 INFO L226 Difference]: Without dead ends: 2602 [2020-10-21 23:00:31,663 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-21 23:00:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-10-21 23:00:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-10-21 23:00:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-10-21 23:00:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-10-21 23:00:31,858 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-10-21 23:00:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:31,859 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-10-21 23:00:31,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:00:31,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-10-21 23:00:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:00:31,864 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:31,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:31,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:00:31,864 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:31,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1841214313, now seen corresponding path program 1 times [2020-10-21 23:00:31,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:31,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12973504] [2020-10-21 23:00:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:32,049 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-21 23:00:32,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12973504] [2020-10-21 23:00:32,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:32,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:00:32,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262821737] [2020-10-21 23:00:32,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:32,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:32,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:32,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:32,052 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-10-21 23:00:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:32,139 INFO L93 Difference]: Finished difference Result 2986 states and 11176 transitions. [2020-10-21 23:00:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:32,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 23:00:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:32,162 INFO L225 Difference]: With dead ends: 2986 [2020-10-21 23:00:32,162 INFO L226 Difference]: Without dead ends: 2506 [2020-10-21 23:00:32,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-10-21 23:00:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506. [2020-10-21 23:00:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-10-21 23:00:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9624 transitions. [2020-10-21 23:00:32,271 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 9624 transitions. Word has length 12 [2020-10-21 23:00:32,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:32,272 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 9624 transitions. [2020-10-21 23:00:32,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:32,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 9624 transitions. [2020-10-21 23:00:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:00:32,276 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:32,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:32,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:00:32,276 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:32,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:32,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1244864964, now seen corresponding path program 1 times [2020-10-21 23:00:32,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:32,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681813619] [2020-10-21 23:00:32,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:32,499 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-21 23:00:32,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681813619] [2020-10-21 23:00:32,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:32,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:00:32,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381195858] [2020-10-21 23:00:32,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:32,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:32,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:32,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:32,503 INFO L87 Difference]: Start difference. First operand 2506 states and 9624 transitions. Second operand 4 states. [2020-10-21 23:00:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:32,577 INFO L93 Difference]: Finished difference Result 2794 states and 10416 transitions. [2020-10-21 23:00:32,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:32,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 23:00:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:32,599 INFO L225 Difference]: With dead ends: 2794 [2020-10-21 23:00:32,599 INFO L226 Difference]: Without dead ends: 2410 [2020-10-21 23:00:32,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:32,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-21 23:00:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-21 23:00:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-21 23:00:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9184 transitions. [2020-10-21 23:00:32,774 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9184 transitions. Word has length 13 [2020-10-21 23:00:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:32,774 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9184 transitions. [2020-10-21 23:00:32,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9184 transitions. [2020-10-21 23:00:32,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:00:32,777 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:32,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:32,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:00:32,778 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:32,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:32,782 INFO L82 PathProgramCache]: Analyzing trace with hash 64021515, now seen corresponding path program 1 times [2020-10-21 23:00:32,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:32,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928640838] [2020-10-21 23:00:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:32,909 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-21 23:00:32,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928640838] [2020-10-21 23:00:32,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:32,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:00:32,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265554816] [2020-10-21 23:00:32,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:32,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:32,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:32,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:32,916 INFO L87 Difference]: Start difference. First operand 2410 states and 9184 transitions. Second operand 4 states. [2020-10-21 23:00:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:32,981 INFO L93 Difference]: Finished difference Result 2538 states and 9400 transitions. [2020-10-21 23:00:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:32,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 23:00:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:33,003 INFO L225 Difference]: With dead ends: 2538 [2020-10-21 23:00:33,003 INFO L226 Difference]: Without dead ends: 2154 [2020-10-21 23:00:33,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-10-21 23:00:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-10-21 23:00:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-10-21 23:00:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-10-21 23:00:33,092 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 14 [2020-10-21 23:00:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:33,093 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-10-21 23:00:33,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-10-21 23:00:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:00:33,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:33,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:33,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:00:33,097 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:33,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:33,098 INFO L82 PathProgramCache]: Analyzing trace with hash -47248263, now seen corresponding path program 1 times [2020-10-21 23:00:33,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:33,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708583455] [2020-10-21 23:00:33,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:33,321 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-21 23:00:33,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708583455] [2020-10-21 23:00:33,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:33,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:33,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080083176] [2020-10-21 23:00:33,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:00:33,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:33,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:00:33,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:33,325 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 6 states. [2020-10-21 23:00:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:33,477 INFO L93 Difference]: Finished difference Result 2322 states and 8524 transitions. [2020-10-21 23:00:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:00:33,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-21 23:00:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:33,495 INFO L225 Difference]: With dead ends: 2322 [2020-10-21 23:00:33,495 INFO L226 Difference]: Without dead ends: 2066 [2020-10-21 23:00:33,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:33,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2020-10-21 23:00:33,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2066. [2020-10-21 23:00:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2066 states. [2020-10-21 23:00:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 7728 transitions. [2020-10-21 23:00:33,566 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 7728 transitions. Word has length 16 [2020-10-21 23:00:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:33,566 INFO L481 AbstractCegarLoop]: Abstraction has 2066 states and 7728 transitions. [2020-10-21 23:00:33,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:00:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 7728 transitions. [2020-10-21 23:00:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:00:33,571 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:33,571 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:33,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:00:33,571 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:33,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:33,572 INFO L82 PathProgramCache]: Analyzing trace with hash -4480891, now seen corresponding path program 1 times [2020-10-21 23:00:33,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:33,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553916299] [2020-10-21 23:00:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:33,719 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-21 23:00:33,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553916299] [2020-10-21 23:00:33,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:33,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:33,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827654017] [2020-10-21 23:00:33,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:33,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:33,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:33,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:33,722 INFO L87 Difference]: Start difference. First operand 2066 states and 7728 transitions. Second operand 7 states. [2020-10-21 23:00:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:33,912 INFO L93 Difference]: Finished difference Result 2558 states and 9488 transitions. [2020-10-21 23:00:33,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:33,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-21 23:00:33,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:33,935 INFO L225 Difference]: With dead ends: 2558 [2020-10-21 23:00:33,935 INFO L226 Difference]: Without dead ends: 2362 [2020-10-21 23:00:33,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:00:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2020-10-21 23:00:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2306. [2020-10-21 23:00:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2020-10-21 23:00:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 8680 transitions. [2020-10-21 23:00:34,110 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 8680 transitions. Word has length 17 [2020-10-21 23:00:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:34,110 INFO L481 AbstractCegarLoop]: Abstraction has 2306 states and 8680 transitions. [2020-10-21 23:00:34,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 8680 transitions. [2020-10-21 23:00:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:00:34,118 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:34,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:34,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:00:34,119 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:34,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:34,120 INFO L82 PathProgramCache]: Analyzing trace with hash 679384481, now seen corresponding path program 2 times [2020-10-21 23:00:34,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:34,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540116048] [2020-10-21 23:00:34,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:34,302 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-21 23:00:34,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540116048] [2020-10-21 23:00:34,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:34,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:34,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589502260] [2020-10-21 23:00:34,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:34,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:34,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:34,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:34,308 INFO L87 Difference]: Start difference. First operand 2306 states and 8680 transitions. Second operand 7 states. [2020-10-21 23:00:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:34,465 INFO L93 Difference]: Finished difference Result 2538 states and 9410 transitions. [2020-10-21 23:00:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:34,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-21 23:00:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:34,490 INFO L225 Difference]: With dead ends: 2538 [2020-10-21 23:00:34,490 INFO L226 Difference]: Without dead ends: 2370 [2020-10-21 23:00:34,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2020-10-21 23:00:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2226. [2020-10-21 23:00:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2020-10-21 23:00:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 8304 transitions. [2020-10-21 23:00:34,566 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 8304 transitions. Word has length 17 [2020-10-21 23:00:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:34,566 INFO L481 AbstractCegarLoop]: Abstraction has 2226 states and 8304 transitions. [2020-10-21 23:00:34,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:34,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 8304 transitions. [2020-10-21 23:00:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:00:34,571 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:34,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:34,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:00:34,572 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:34,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:34,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2119478795, now seen corresponding path program 3 times [2020-10-21 23:00:34,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:34,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017406714] [2020-10-21 23:00:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:34,715 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-21 23:00:34,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017406714] [2020-10-21 23:00:34,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:34,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:34,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380340535] [2020-10-21 23:00:34,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:34,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:34,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:34,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:34,717 INFO L87 Difference]: Start difference. First operand 2226 states and 8304 transitions. Second operand 7 states. [2020-10-21 23:00:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:34,858 INFO L93 Difference]: Finished difference Result 2482 states and 9162 transitions. [2020-10-21 23:00:34,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:34,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-21 23:00:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:34,870 INFO L225 Difference]: With dead ends: 2482 [2020-10-21 23:00:34,870 INFO L226 Difference]: Without dead ends: 2314 [2020-10-21 23:00:34,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2020-10-21 23:00:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2106. [2020-10-21 23:00:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-10-21 23:00:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7832 transitions. [2020-10-21 23:00:34,938 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7832 transitions. Word has length 17 [2020-10-21 23:00:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:34,938 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7832 transitions. [2020-10-21 23:00:34,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7832 transitions. [2020-10-21 23:00:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:00:34,943 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:34,943 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-21 23:00:34,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:00:34,944 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:34,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:34,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1349936792, now seen corresponding path program 1 times [2020-10-21 23:00:34,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:34,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715661160] [2020-10-21 23:00:34,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:35,112 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-21 23:00:35,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715661160] [2020-10-21 23:00:35,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:35,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:35,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234867617] [2020-10-21 23:00:35,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:00:35,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:35,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:00:35,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:35,114 INFO L87 Difference]: Start difference. First operand 2106 states and 7832 transitions. Second operand 8 states. [2020-10-21 23:00:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:35,285 INFO L93 Difference]: Finished difference Result 3066 states and 11164 transitions. [2020-10-21 23:00:35,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:35,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-21 23:00:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:35,296 INFO L225 Difference]: With dead ends: 3066 [2020-10-21 23:00:35,296 INFO L226 Difference]: Without dead ends: 2610 [2020-10-21 23:00:35,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:00:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-21 23:00:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2442. [2020-10-21 23:00:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-10-21 23:00:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9040 transitions. [2020-10-21 23:00:35,371 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9040 transitions. Word has length 18 [2020-10-21 23:00:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:35,372 INFO L481 AbstractCegarLoop]: Abstraction has 2442 states and 9040 transitions. [2020-10-21 23:00:35,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:00:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9040 transitions. [2020-10-21 23:00:35,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:00:35,379 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:35,379 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-21 23:00:35,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:00:35,379 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:35,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1797912376, now seen corresponding path program 1 times [2020-10-21 23:00:35,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:35,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523209767] [2020-10-21 23:00:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:35,546 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-21 23:00:35,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523209767] [2020-10-21 23:00:35,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:35,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:00:35,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436942936] [2020-10-21 23:00:35,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:35,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:35,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:35,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:35,548 INFO L87 Difference]: Start difference. First operand 2442 states and 9040 transitions. Second operand 4 states. [2020-10-21 23:00:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:35,586 INFO L93 Difference]: Finished difference Result 2522 states and 8500 transitions. [2020-10-21 23:00:35,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:00:35,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-21 23:00:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:35,594 INFO L225 Difference]: With dead ends: 2522 [2020-10-21 23:00:35,595 INFO L226 Difference]: Without dead ends: 1898 [2020-10-21 23:00:35,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-10-21 23:00:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2020-10-21 23:00:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-10-21 23:00:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 6338 transitions. [2020-10-21 23:00:35,647 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 6338 transitions. Word has length 18 [2020-10-21 23:00:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:35,647 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 6338 transitions. [2020-10-21 23:00:35,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 6338 transitions. [2020-10-21 23:00:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:00:35,652 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:35,652 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:35,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:00:35,653 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:35,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:35,653 INFO L82 PathProgramCache]: Analyzing trace with hash -682956174, now seen corresponding path program 1 times [2020-10-21 23:00:35,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:35,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665409863] [2020-10-21 23:00:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:35,726 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-21 23:00:35,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665409863] [2020-10-21 23:00:35,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:35,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:35,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113471577] [2020-10-21 23:00:35,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:00:35,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:35,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:00:35,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:35,728 INFO L87 Difference]: Start difference. First operand 1898 states and 6338 transitions. Second operand 5 states. [2020-10-21 23:00:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:35,776 INFO L93 Difference]: Finished difference Result 1602 states and 4889 transitions. [2020-10-21 23:00:35,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:35,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-21 23:00:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:35,781 INFO L225 Difference]: With dead ends: 1602 [2020-10-21 23:00:35,781 INFO L226 Difference]: Without dead ends: 1212 [2020-10-21 23:00:35,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:35,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-10-21 23:00:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2020-10-21 23:00:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2020-10-21 23:00:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 3624 transitions. [2020-10-21 23:00:35,811 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 3624 transitions. Word has length 19 [2020-10-21 23:00:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:35,811 INFO L481 AbstractCegarLoop]: Abstraction has 1212 states and 3624 transitions. [2020-10-21 23:00:35,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:00:35,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 3624 transitions. [2020-10-21 23:00:35,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 23:00:35,815 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:35,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:35,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:00:35,815 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:35,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:35,816 INFO L82 PathProgramCache]: Analyzing trace with hash -525600601, now seen corresponding path program 1 times [2020-10-21 23:00:35,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:35,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171743560] [2020-10-21 23:00:35,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:35,893 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-21 23:00:35,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171743560] [2020-10-21 23:00:35,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:35,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:00:35,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156886469] [2020-10-21 23:00:35,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:35,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:35,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:35,895 INFO L87 Difference]: Start difference. First operand 1212 states and 3624 transitions. Second operand 4 states. [2020-10-21 23:00:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:35,939 INFO L93 Difference]: Finished difference Result 1809 states and 5226 transitions. [2020-10-21 23:00:35,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:35,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-21 23:00:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:35,943 INFO L225 Difference]: With dead ends: 1809 [2020-10-21 23:00:35,943 INFO L226 Difference]: Without dead ends: 1240 [2020-10-21 23:00:35,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2020-10-21 23:00:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1200. [2020-10-21 23:00:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2020-10-21 23:00:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 3396 transitions. [2020-10-21 23:00:35,972 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 3396 transitions. Word has length 20 [2020-10-21 23:00:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:35,972 INFO L481 AbstractCegarLoop]: Abstraction has 1200 states and 3396 transitions. [2020-10-21 23:00:35,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 3396 transitions. [2020-10-21 23:00:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:00:35,975 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:35,975 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] [2020-10-21 23:00:35,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:00:35,975 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash 905378528, now seen corresponding path program 1 times [2020-10-21 23:00:35,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:35,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737114634] [2020-10-21 23:00:35,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:36,097 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-21 23:00:36,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737114634] [2020-10-21 23:00:36,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:36,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:00:36,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159208775] [2020-10-21 23:00:36,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:36,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:36,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:36,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:36,099 INFO L87 Difference]: Start difference. First operand 1200 states and 3396 transitions. Second operand 4 states. [2020-10-21 23:00:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:36,137 INFO L93 Difference]: Finished difference Result 1753 states and 4749 transitions. [2020-10-21 23:00:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:36,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-21 23:00:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:36,141 INFO L225 Difference]: With dead ends: 1753 [2020-10-21 23:00:36,141 INFO L226 Difference]: Without dead ends: 1216 [2020-10-21 23:00:36,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2020-10-21 23:00:36,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1162. [2020-10-21 23:00:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2020-10-21 23:00:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 3114 transitions. [2020-10-21 23:00:36,173 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 3114 transitions. Word has length 21 [2020-10-21 23:00:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:36,173 INFO L481 AbstractCegarLoop]: Abstraction has 1162 states and 3114 transitions. [2020-10-21 23:00:36,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 3114 transitions. [2020-10-21 23:00:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:00:36,177 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:36,177 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] [2020-10-21 23:00:36,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:00:36,177 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:36,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:36,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1527121136, now seen corresponding path program 1 times [2020-10-21 23:00:36,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:36,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306055014] [2020-10-21 23:00:36,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:36,253 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-21 23:00:36,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306055014] [2020-10-21 23:00:36,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:36,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:36,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130513550] [2020-10-21 23:00:36,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:00:36,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:36,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:00:36,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:36,256 INFO L87 Difference]: Start difference. First operand 1162 states and 3114 transitions. Second operand 6 states. [2020-10-21 23:00:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:36,321 INFO L93 Difference]: Finished difference Result 992 states and 2597 transitions. [2020-10-21 23:00:36,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:00:36,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-21 23:00:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:36,324 INFO L225 Difference]: With dead ends: 992 [2020-10-21 23:00:36,325 INFO L226 Difference]: Without dead ends: 774 [2020-10-21 23:00:36,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:00:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2020-10-21 23:00:36,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 684. [2020-10-21 23:00:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2020-10-21 23:00:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1750 transitions. [2020-10-21 23:00:36,340 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1750 transitions. Word has length 21 [2020-10-21 23:00:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:36,341 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 1750 transitions. [2020-10-21 23:00:36,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:00:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1750 transitions. [2020-10-21 23:00:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 23:00:36,342 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:36,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:36,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:00:36,343 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1198049199, now seen corresponding path program 1 times [2020-10-21 23:00:36,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:36,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531611388] [2020-10-21 23:00:36,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:36,415 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-21 23:00:36,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531611388] [2020-10-21 23:00:36,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:36,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:36,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152298355] [2020-10-21 23:00:36,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:00:36,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:36,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:00:36,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:36,417 INFO L87 Difference]: Start difference. First operand 684 states and 1750 transitions. Second operand 5 states. [2020-10-21 23:00:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:36,464 INFO L93 Difference]: Finished difference Result 870 states and 2144 transitions. [2020-10-21 23:00:36,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:36,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-10-21 23:00:36,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:36,466 INFO L225 Difference]: With dead ends: 870 [2020-10-21 23:00:36,466 INFO L226 Difference]: Without dead ends: 459 [2020-10-21 23:00:36,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2020-10-21 23:00:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2020-10-21 23:00:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-10-21 23:00:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1017 transitions. [2020-10-21 23:00:36,477 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1017 transitions. Word has length 24 [2020-10-21 23:00:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:36,477 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 1017 transitions. [2020-10-21 23:00:36,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:00:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1017 transitions. [2020-10-21 23:00:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 23:00:36,478 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:36,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:36,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:00:36,479 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1202140058, now seen corresponding path program 1 times [2020-10-21 23:00:36,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:36,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346399544] [2020-10-21 23:00:36,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:36,649 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-21 23:00:36,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346399544] [2020-10-21 23:00:36,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:36,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:36,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151071331] [2020-10-21 23:00:36,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:36,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:36,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:36,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:36,652 INFO L87 Difference]: Start difference. First operand 455 states and 1017 transitions. Second operand 7 states. [2020-10-21 23:00:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:36,896 INFO L93 Difference]: Finished difference Result 529 states and 1178 transitions. [2020-10-21 23:00:36,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:36,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-21 23:00:36,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:36,898 INFO L225 Difference]: With dead ends: 529 [2020-10-21 23:00:36,899 INFO L226 Difference]: Without dead ends: 497 [2020-10-21 23:00:36,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:00:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-10-21 23:00:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 447. [2020-10-21 23:00:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-10-21 23:00:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 993 transitions. [2020-10-21 23:00:36,909 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 993 transitions. Word has length 24 [2020-10-21 23:00:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:36,909 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 993 transitions. [2020-10-21 23:00:36,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 993 transitions. [2020-10-21 23:00:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 23:00:36,911 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:36,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:36,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:00:36,911 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:36,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:36,912 INFO L82 PathProgramCache]: Analyzing trace with hash 512739638, now seen corresponding path program 2 times [2020-10-21 23:00:36,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:36,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188022886] [2020-10-21 23:00:36,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:37,053 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-21 23:00:37,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188022886] [2020-10-21 23:00:37,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:37,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:37,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871199547] [2020-10-21 23:00:37,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:00:37,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:37,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:00:37,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:37,056 INFO L87 Difference]: Start difference. First operand 447 states and 993 transitions. Second operand 8 states. [2020-10-21 23:00:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:37,272 INFO L93 Difference]: Finished difference Result 479 states and 1062 transitions. [2020-10-21 23:00:37,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:37,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-21 23:00:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:37,274 INFO L225 Difference]: With dead ends: 479 [2020-10-21 23:00:37,274 INFO L226 Difference]: Without dead ends: 354 [2020-10-21 23:00:37,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:00:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-10-21 23:00:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 322. [2020-10-21 23:00:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-10-21 23:00:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 700 transitions. [2020-10-21 23:00:37,285 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 700 transitions. Word has length 24 [2020-10-21 23:00:37,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:37,286 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 700 transitions. [2020-10-21 23:00:37,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:00:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 700 transitions. [2020-10-21 23:00:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 23:00:37,287 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:37,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:37,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:00:37,288 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:37,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:37,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1018346385, now seen corresponding path program 2 times [2020-10-21 23:00:37,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:37,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821279192] [2020-10-21 23:00:37,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:37,381 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-21 23:00:37,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821279192] [2020-10-21 23:00:37,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:37,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:37,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208215396] [2020-10-21 23:00:37,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:37,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:37,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:37,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:37,384 INFO L87 Difference]: Start difference. First operand 322 states and 700 transitions. Second operand 7 states. [2020-10-21 23:00:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:37,484 INFO L93 Difference]: Finished difference Result 293 states and 643 transitions. [2020-10-21 23:00:37,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:37,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-21 23:00:37,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:37,486 INFO L225 Difference]: With dead ends: 293 [2020-10-21 23:00:37,486 INFO L226 Difference]: Without dead ends: 65 [2020-10-21 23:00:37,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:00:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-21 23:00:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-21 23:00:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-21 23:00:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-10-21 23:00:37,490 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 24 [2020-10-21 23:00:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:37,490 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-10-21 23:00:37,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-10-21 23:00:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:00:37,491 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:37,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:37,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:00:37,492 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1677699125, now seen corresponding path program 1 times [2020-10-21 23:00:37,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:37,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322726320] [2020-10-21 23:00:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:00:37,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:00:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:00:37,585 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:00:37,627 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:00:37,628 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:00:37,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 23:00:37,666 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-21 23:00:37,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,666 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-21 23:00:37,666 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-10-21 23:00:37,669 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-21 23:00:37,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,669 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-21 23:00:37,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,669 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-21 23:00:37,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,670 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-21 23:00:37,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,670 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-21 23:00:37,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,671 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-21 23:00:37,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,671 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-21 23:00:37,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,672 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-21 23:00:37,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,672 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-21 23:00:37,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,672 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-21 23:00:37,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,672 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-21 23:00:37,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,673 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-21 23:00:37,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,673 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-21 23:00:37,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,674 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-21 23:00:37,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,674 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-21 23:00:37,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,674 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-21 23:00:37,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,675 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-21 23:00:37,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,675 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-21 23:00:37,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,676 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-21 23:00:37,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,676 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-21 23:00:37,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,676 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-21 23:00:37,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,676 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-21 23:00:37,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,677 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-21 23:00:37,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,677 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-21 23:00:37,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,677 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-21 23:00:37,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,678 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-21 23:00:37,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,678 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-21 23:00:37,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,678 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-21 23:00:37,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,679 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-21 23:00:37,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,679 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-21 23:00:37,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,679 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-21 23:00:37,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:37,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:00:37 BasicIcfg [2020-10-21 23:00:37,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:00:37,779 INFO L168 Benchmark]: Toolchain (without parser) took 14260.14 ms. Allocated memory was 145.8 MB in the beginning and 491.3 MB in the end (delta: 345.5 MB). Free memory was 100.4 MB in the beginning and 232.6 MB in the end (delta: -132.1 MB). Peak memory consumption was 213.4 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:37,780 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 23:00:37,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 965.99 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 99.6 MB in the beginning and 152.7 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:37,781 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.70 ms. Allocated memory is still 202.9 MB. Free memory was 152.7 MB in the beginning and 149.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:37,782 INFO L168 Benchmark]: Boogie Preprocessor took 52.09 ms. Allocated memory is still 202.9 MB. Free memory was 149.9 MB in the beginning and 147.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:37,783 INFO L168 Benchmark]: RCFGBuilder took 2250.14 ms. Allocated memory was 202.9 MB in the beginning and 249.6 MB in the end (delta: 46.7 MB). Free memory was 147.1 MB in the beginning and 184.4 MB in the end (delta: -37.3 MB). Peak memory consumption was 101.1 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:37,784 INFO L168 Benchmark]: TraceAbstraction took 10908.51 ms. Allocated memory was 249.6 MB in the beginning and 491.3 MB in the end (delta: 241.7 MB). Free memory was 184.4 MB in the beginning and 232.6 MB in the end (delta: -48.1 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:37,793 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.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 965.99 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 99.6 MB in the beginning and 152.7 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.70 ms. Allocated memory is still 202.9 MB. Free memory was 152.7 MB in the beginning and 149.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.09 ms. Allocated memory is still 202.9 MB. Free memory was 149.9 MB in the beginning and 147.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2250.14 ms. Allocated memory was 202.9 MB in the beginning and 249.6 MB in the end (delta: 46.7 MB). Free memory was 147.1 MB in the beginning and 184.4 MB in the end (delta: -37.3 MB). Peak memory consumption was 101.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10908.51 ms. Allocated memory was 249.6 MB in the beginning and 491.3 MB in the end (delta: 241.7 MB). Free memory was 184.4 MB in the beginning and 232.6 MB in the end (delta: -48.1 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1512 VarBasedMoverChecksPositive, 28 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 148 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.6s, 130 PlacesBefore, 47 PlacesAfterwards, 120 TransitionsBefore, 35 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 8162 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1269; [L845] FCALL, FORK 0 pthread_create(&t1269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L846] 0 pthread_t t1270; [L847] FCALL, FORK 0 pthread_create(&t1270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L848] 0 pthread_t t1271; [L849] FCALL, FORK 0 pthread_create(&t1271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L850] 0 pthread_t t1272; [L851] FCALL, FORK 0 pthread_create(&t1272, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix047_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L780] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L783] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L786] 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) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] 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) [L786] 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) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 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 [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 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 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L3] COND FALSE 0 !(!cond) [L857] 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) [L857] 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) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 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 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 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 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 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) [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L868] 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) [L868] 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) [L869] 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)) [L869] 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) [L869] 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)) [L869] 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)) [L870] 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)) [L870] 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 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L870] 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)) [L870] 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)) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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)) [L873] 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)) [L873] EXPR 0 !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) [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] EXPR 0 !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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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) [L874] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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", "mix047_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 725 SDtfs, 944 SDslu, 1540 SDs, 0 SdLazy, 485 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4122occurred 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: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 846 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 310 ConstructedInterpolants, 0 QuantifiedInterpolants, 34690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...