/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:53:43,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:53:43,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:53:43,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:53:43,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:53:43,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:53:43,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:53:43,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:53:43,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:53:43,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:53:43,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:53:43,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:53:43,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:53:43,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:53:43,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:53:43,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:53:43,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:53:43,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:53:43,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:53:43,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:53:43,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:53:43,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:53:43,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:53:43,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:53:43,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:53:43,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:53:43,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:53:43,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:53:43,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:53:43,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:53:43,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:53:43,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:53:43,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:53:43,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:53:43,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:53:43,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:53:43,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:53:43,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:53:43,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:53:43,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:53:43,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:53:43,684 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-11-09 16:53:43,712 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:53:43,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:53:43,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:53:43,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:53:43,715 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:53:43,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:53:43,716 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:53:43,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:53:43,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:53:43,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:53:43,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:53:43,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:53:43,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:53:43,717 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:53:43,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:53:43,718 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:53:43,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:53:43,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:53:43,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:53:43,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:53:43,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:53:43,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:53:43,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:53:43,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:53:43,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:53:43,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:53:43,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:53:43,721 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:53:43,722 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:53:43,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:53:43,722 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 16:53:44,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:53:44,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:53:44,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:53:44,178 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:53:44,179 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:53:44,180 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2020-11-09 16:53:44,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18892d3df/a750d6af110e42218605d5428fc19e68/FLAGc1ef742c4 [2020-11-09 16:53:45,066 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:53:45,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2020-11-09 16:53:45,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18892d3df/a750d6af110e42218605d5428fc19e68/FLAGc1ef742c4 [2020-11-09 16:53:45,291 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18892d3df/a750d6af110e42218605d5428fc19e68 [2020-11-09 16:53:45,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:53:45,308 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:53:45,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:53:45,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:53:45,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:53:45,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:53:45" (1/1) ... [2020-11-09 16:53:45,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4acd0b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:45, skipping insertion in model container [2020-11-09 16:53:45,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:53:45" (1/1) ... [2020-11-09 16:53:45,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:53:45,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:53:46,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:53:46,098 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:53:46,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:53:46,352 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:53:46,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:46 WrapperNode [2020-11-09 16:53:46,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:53:46,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:53:46,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:53:46,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:53:46,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:46" (1/1) ... [2020-11-09 16:53:46,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:46" (1/1) ... [2020-11-09 16:53:46,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:53:46,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:53:46,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:53:46,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:53:46,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:46" (1/1) ... [2020-11-09 16:53:46,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:46" (1/1) ... [2020-11-09 16:53:46,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:46" (1/1) ... [2020-11-09 16:53:46,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:46" (1/1) ... [2020-11-09 16:53:46,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:46" (1/1) ... [2020-11-09 16:53:46,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:46" (1/1) ... [2020-11-09 16:53:46,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:46" (1/1) ... [2020-11-09 16:53:46,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:53:46,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:53:46,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:53:46,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:53:46,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:53:46,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:53:46,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 16:53:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:53:46,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:53:46,620 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 16:53:46,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 16:53:46,622 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 16:53:46,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 16:53:46,623 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 16:53:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 16:53:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-09 16:53:46,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-09 16:53:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:53:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 16:53:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:53:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:53:46,627 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 16:53:49,093 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:53:49,093 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 16:53:49,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:53:49 BoogieIcfgContainer [2020-11-09 16:53:49,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:53:49,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:53:49,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:53:49,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:53:49,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:53:45" (1/3) ... [2020-11-09 16:53:49,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1878fdac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:53:49, skipping insertion in model container [2020-11-09 16:53:49,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:53:46" (2/3) ... [2020-11-09 16:53:49,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1878fdac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:53:49, skipping insertion in model container [2020-11-09 16:53:49,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:53:49" (3/3) ... [2020-11-09 16:53:49,106 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_pso.opt.i [2020-11-09 16:53:49,124 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:53:49,124 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:53:49,129 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 16:53:49,130 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:53:49,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,170 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,170 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,171 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,171 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,173 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,173 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,173 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,173 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,175 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,175 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,176 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,176 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,181 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,181 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,181 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,181 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,181 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,181 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,182 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,182 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,183 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,184 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,185 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,185 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,185 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,185 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,186 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,186 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,186 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,186 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,186 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,186 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,188 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,188 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,188 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,188 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,191 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,193 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,194 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,199 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,203 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,204 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,209 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,209 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:53:49,211 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 16:53:49,224 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 16:53:49,246 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:53:49,246 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:53:49,246 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:53:49,247 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:53:49,247 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:53:49,247 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:53:49,247 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:53:49,247 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:53:49,260 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:53:49,261 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 117 transitions, 254 flow [2020-11-09 16:53:49,264 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 117 transitions, 254 flow [2020-11-09 16:53:49,266 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 117 transitions, 254 flow [2020-11-09 16:53:49,321 INFO L129 PetriNetUnfolder]: 3/113 cut-off events. [2020-11-09 16:53:49,321 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 16:53:49,326 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-11-09 16:53:49,331 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-11-09 16:53:50,054 WARN L194 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 16:53:50,233 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-11-09 16:53:50,352 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-11-09 16:53:51,988 WARN L194 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-11-09 16:53:52,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-09 16:53:52,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:53:52,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 16:53:52,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:53:53,471 WARN L194 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-11-09 16:53:55,996 WARN L194 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-11-09 16:53:56,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:53:56,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:53:56,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:53:56,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:53:56,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:53:56,041 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-11-09 16:53:56,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 16:53:56,069 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-11-09 16:53:56,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 1] term [2020-11-09 16:53:56,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:53:56,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 1] term [2020-11-09 16:53:56,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:53:56,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:53:56,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:53:56,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:53:56,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:53:56,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:53:56,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:53:56,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:53:56,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:53:56,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:53:56,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:53:56,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:53:56,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:53:56,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:53:56,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:53:56,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:53:56,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:53:56,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:53:56,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:53:56,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:53:56,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:54:00,188 WARN L194 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 369 DAG size of output: 271 [2020-11-09 16:54:02,148 WARN L194 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 16:54:02,279 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:54:02,902 WARN L194 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2020-11-09 16:54:02,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 16:54:02,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:54:03,390 WARN L194 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2020-11-09 16:54:03,786 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-09 16:54:03,953 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-09 16:54:04,535 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:54:04,667 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:54:04,929 WARN L194 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-09 16:54:05,160 WARN L194 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-09 16:54:07,476 WARN L194 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2020-11-09 16:54:07,839 WARN L194 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-11-09 16:54:10,817 WARN L194 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 261 DAG size of output: 221 [2020-11-09 16:54:11,841 WARN L194 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 220 [2020-11-09 16:54:13,029 WARN L194 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-11-09 16:54:13,447 WARN L194 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 16:54:15,766 WARN L194 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 261 DAG size of output: 222 [2020-11-09 16:54:16,838 WARN L194 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 221 [2020-11-09 16:54:16,968 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 16:54:17,110 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 16:54:17,234 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 16:54:17,362 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 16:54:18,814 WARN L194 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 143 DAG size of output: 134 [2020-11-09 16:54:19,290 WARN L194 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-11-09 16:54:25,728 WARN L194 SmtUtils]: Spent 6.44 s on a formula simplification. DAG size of input: 277 DAG size of output: 256 [2020-11-09 16:54:27,835 WARN L194 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 254 [2020-11-09 16:54:28,531 WARN L194 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-09 16:54:28,849 WARN L194 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-09 16:54:29,507 WARN L194 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-09 16:54:29,814 WARN L194 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-09 16:54:29,894 INFO L131 LiptonReduction]: Checked pairs total: 6769 [2020-11-09 16:54:29,894 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-11-09 16:54:29,900 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-11-09 16:54:30,065 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-11-09 16:54:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-11-09 16:54:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 16:54:30,075 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:30,076 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:54:30,076 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-11-09 16:54:30,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:30,083 INFO L82 PathProgramCache]: Analyzing trace with hash 172921797, now seen corresponding path program 1 times [2020-11-09 16:54:30,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:30,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647327707] [2020-11-09 16:54:30,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:30,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647327707] [2020-11-09 16:54:30,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:30,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:54:30,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474992899] [2020-11-09 16:54:30,497 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:30,501 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:30,523 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 16:54:30,523 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:30,529 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:54:30,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:54:30,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:30,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:54:30,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:54:30,552 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-11-09 16:54:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:30,712 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-11-09 16:54:30,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:54:30,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 16:54:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:30,753 INFO L225 Difference]: With dead ends: 2202 [2020-11-09 16:54:30,753 INFO L226 Difference]: Without dead ends: 1802 [2020-11-09 16:54:30,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:54:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-11-09 16:54:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-11-09 16:54:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-11-09 16:54:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-11-09 16:54:30,918 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-11-09 16:54:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:30,919 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-11-09 16:54:30,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:54:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-11-09 16:54:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 16:54:30,922 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:30,922 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:54:30,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:54:30,923 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-11-09 16:54:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1325818042, now seen corresponding path program 1 times [2020-11-09 16:54:30,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:30,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048703919] [2020-11-09 16:54:30,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:31,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048703919] [2020-11-09 16:54:31,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:31,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:54:31,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541530878] [2020-11-09 16:54:31,130 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:31,132 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:31,139 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-11-09 16:54:31,139 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:31,139 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:54:31,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:54:31,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:31,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:54:31,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:54:31,145 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-11-09 16:54:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:31,223 INFO L93 Difference]: Finished difference Result 1792 states and 6736 transitions. [2020-11-09 16:54:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:54:31,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 16:54:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:31,242 INFO L225 Difference]: With dead ends: 1792 [2020-11-09 16:54:31,243 INFO L226 Difference]: Without dead ends: 1792 [2020-11-09 16:54:31,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:54:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2020-11-09 16:54:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2020-11-09 16:54:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2020-11-09 16:54:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 6736 transitions. [2020-11-09 16:54:31,342 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 6736 transitions. Word has length 11 [2020-11-09 16:54:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:31,342 INFO L481 AbstractCegarLoop]: Abstraction has 1792 states and 6736 transitions. [2020-11-09 16:54:31,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:54:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 6736 transitions. [2020-11-09 16:54:31,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 16:54:31,353 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:31,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:54:31,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:54:31,353 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-11-09 16:54:31,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:31,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1861488477, now seen corresponding path program 1 times [2020-11-09 16:54:31,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:31,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121350075] [2020-11-09 16:54:31,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:31,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121350075] [2020-11-09 16:54:31,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:31,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:54:31,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1316411404] [2020-11-09 16:54:31,524 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:31,526 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:31,529 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-11-09 16:54:31,529 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:31,599 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:54:31,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:31,600 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:31,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:31,721 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:54:31,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:54:31,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:31,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:54:31,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:54:31,726 INFO L87 Difference]: Start difference. First operand 1792 states and 6736 transitions. Second operand 4 states. [2020-11-09 16:54:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:31,840 INFO L93 Difference]: Finished difference Result 1764 states and 6612 transitions. [2020-11-09 16:54:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:54:31,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-09 16:54:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:31,864 INFO L225 Difference]: With dead ends: 1764 [2020-11-09 16:54:31,865 INFO L226 Difference]: Without dead ends: 1764 [2020-11-09 16:54:31,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:54:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2020-11-09 16:54:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1764. [2020-11-09 16:54:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1764 states. [2020-11-09 16:54:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 6612 transitions. [2020-11-09 16:54:31,966 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 6612 transitions. Word has length 12 [2020-11-09 16:54:31,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:31,966 INFO L481 AbstractCegarLoop]: Abstraction has 1764 states and 6612 transitions. [2020-11-09 16:54:31,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:54:31,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 6612 transitions. [2020-11-09 16:54:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 16:54:31,968 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:31,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:54:31,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 16:54:31,968 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-11-09 16:54:31,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:31,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1849246298, now seen corresponding path program 1 times [2020-11-09 16:54:31,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:31,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503022829] [2020-11-09 16:54:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:32,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503022829] [2020-11-09 16:54:32,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:32,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:54:32,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1360703256] [2020-11-09 16:54:32,067 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:32,073 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:32,077 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 14 transitions. [2020-11-09 16:54:32,078 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:32,082 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:54:32,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:54:32,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:32,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:54:32,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:54:32,083 INFO L87 Difference]: Start difference. First operand 1764 states and 6612 transitions. Second operand 3 states. [2020-11-09 16:54:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:32,116 INFO L93 Difference]: Finished difference Result 1724 states and 6430 transitions. [2020-11-09 16:54:32,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:54:32,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-09 16:54:32,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:32,139 INFO L225 Difference]: With dead ends: 1724 [2020-11-09 16:54:32,139 INFO L226 Difference]: Without dead ends: 1724 [2020-11-09 16:54:32,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:54:32,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2020-11-09 16:54:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2020-11-09 16:54:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2020-11-09 16:54:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 6430 transitions. [2020-11-09 16:54:32,215 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 6430 transitions. Word has length 12 [2020-11-09 16:54:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:32,216 INFO L481 AbstractCegarLoop]: Abstraction has 1724 states and 6430 transitions. [2020-11-09 16:54:32,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:54:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 6430 transitions. [2020-11-09 16:54:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 16:54:32,218 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:32,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:54:32,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:54:32,219 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-11-09 16:54:32,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:32,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1871500579, now seen corresponding path program 1 times [2020-11-09 16:54:32,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:32,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444195410] [2020-11-09 16:54:32,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:32,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444195410] [2020-11-09 16:54:32,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:32,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:54:32,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [748569058] [2020-11-09 16:54:32,354 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:32,356 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:32,361 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 32 transitions. [2020-11-09 16:54:32,362 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:32,379 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 16:54:32,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:32,380 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 16:54:32,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:32,383 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 2, 3, 2, 1] term [2020-11-09 16:54:32,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:32,521 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:54:32,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:54:32,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:32,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:54:32,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:54:32,523 INFO L87 Difference]: Start difference. First operand 1724 states and 6430 transitions. Second operand 4 states. [2020-11-09 16:54:32,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:32,670 INFO L93 Difference]: Finished difference Result 1884 states and 7054 transitions. [2020-11-09 16:54:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:54:32,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 16:54:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:32,692 INFO L225 Difference]: With dead ends: 1884 [2020-11-09 16:54:32,692 INFO L226 Difference]: Without dead ends: 1884 [2020-11-09 16:54:32,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:54:32,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2020-11-09 16:54:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1884. [2020-11-09 16:54:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1884 states. [2020-11-09 16:54:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 7054 transitions. [2020-11-09 16:54:32,773 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 7054 transitions. Word has length 13 [2020-11-09 16:54:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:32,773 INFO L481 AbstractCegarLoop]: Abstraction has 1884 states and 7054 transitions. [2020-11-09 16:54:32,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:54:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 7054 transitions. [2020-11-09 16:54:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 16:54:32,776 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:32,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:54:32,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 16:54:32,776 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-11-09 16:54:32,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:32,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1871566609, now seen corresponding path program 2 times [2020-11-09 16:54:32,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:32,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358422935] [2020-11-09 16:54:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:32,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358422935] [2020-11-09 16:54:32,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:32,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:54:32,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [644665255] [2020-11-09 16:54:32,930 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:32,934 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:32,939 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-11-09 16:54:32,939 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:32,991 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 16:54:32,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:32,992 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 16:54:32,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:33,084 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:54:33,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:54:33,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:33,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:54:33,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:54:33,086 INFO L87 Difference]: Start difference. First operand 1884 states and 7054 transitions. Second operand 5 states. [2020-11-09 16:54:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:33,248 INFO L93 Difference]: Finished difference Result 1828 states and 6806 transitions. [2020-11-09 16:54:33,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:54:33,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-09 16:54:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:33,269 INFO L225 Difference]: With dead ends: 1828 [2020-11-09 16:54:33,269 INFO L226 Difference]: Without dead ends: 1828 [2020-11-09 16:54:33,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:54:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2020-11-09 16:54:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1828. [2020-11-09 16:54:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2020-11-09 16:54:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 6806 transitions. [2020-11-09 16:54:33,346 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 6806 transitions. Word has length 13 [2020-11-09 16:54:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:33,347 INFO L481 AbstractCegarLoop]: Abstraction has 1828 states and 6806 transitions. [2020-11-09 16:54:33,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:54:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 6806 transitions. [2020-11-09 16:54:33,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:54:33,350 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:33,350 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:54:33,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:54:33,351 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-11-09 16:54:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2110987523, now seen corresponding path program 1 times [2020-11-09 16:54:33,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:33,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540102462] [2020-11-09 16:54:33,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:33,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540102462] [2020-11-09 16:54:33,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:33,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:54:33,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1288302421] [2020-11-09 16:54:33,467 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:33,469 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:33,474 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 50 transitions. [2020-11-09 16:54:33,474 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:33,754 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:54:33,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:54:33,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:33,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:54:33,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:54:33,756 INFO L87 Difference]: Start difference. First operand 1828 states and 6806 transitions. Second operand 4 states. [2020-11-09 16:54:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:33,851 INFO L93 Difference]: Finished difference Result 1844 states and 6862 transitions. [2020-11-09 16:54:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:54:33,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-09 16:54:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:33,871 INFO L225 Difference]: With dead ends: 1844 [2020-11-09 16:54:33,872 INFO L226 Difference]: Without dead ends: 1844 [2020-11-09 16:54:33,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:54:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2020-11-09 16:54:33,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2020-11-09 16:54:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2020-11-09 16:54:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 6862 transitions. [2020-11-09 16:54:33,952 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 6862 transitions. Word has length 14 [2020-11-09 16:54:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:33,952 INFO L481 AbstractCegarLoop]: Abstraction has 1844 states and 6862 transitions. [2020-11-09 16:54:33,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:54:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 6862 transitions. [2020-11-09 16:54:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:54:33,956 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:33,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:54:33,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 16:54:33,957 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-11-09 16:54:33,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2113368323, now seen corresponding path program 2 times [2020-11-09 16:54:33,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:33,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824802651] [2020-11-09 16:54:33,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:34,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824802651] [2020-11-09 16:54:34,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:34,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:54:34,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1373990376] [2020-11-09 16:54:34,217 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:34,219 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:34,224 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 60 transitions. [2020-11-09 16:54:34,224 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:34,241 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:54:34,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:34,242 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:34,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:34,437 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:54:34,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:54:34,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:34,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:54:34,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:54:34,439 INFO L87 Difference]: Start difference. First operand 1844 states and 6862 transitions. Second operand 5 states. [2020-11-09 16:54:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:34,616 INFO L93 Difference]: Finished difference Result 1802 states and 6690 transitions. [2020-11-09 16:54:34,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:54:34,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 16:54:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:34,654 INFO L225 Difference]: With dead ends: 1802 [2020-11-09 16:54:34,654 INFO L226 Difference]: Without dead ends: 1802 [2020-11-09 16:54:34,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:54:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-11-09 16:54:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1786. [2020-11-09 16:54:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2020-11-09 16:54:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 6634 transitions. [2020-11-09 16:54:34,748 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 6634 transitions. Word has length 14 [2020-11-09 16:54:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:34,748 INFO L481 AbstractCegarLoop]: Abstraction has 1786 states and 6634 transitions. [2020-11-09 16:54:34,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:54:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 6634 transitions. [2020-11-09 16:54:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:54:34,753 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:34,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:54:34,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 16:54:34,753 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-11-09 16:54:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:34,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1082379228, now seen corresponding path program 1 times [2020-11-09 16:54:34,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:34,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218428757] [2020-11-09 16:54:34,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:34,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218428757] [2020-11-09 16:54:34,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:34,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:54:34,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1790105804] [2020-11-09 16:54:34,927 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:34,930 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:34,938 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 48 transitions. [2020-11-09 16:54:34,939 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:34,945 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:54:35,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:54:35,045 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:35,046 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:35,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,048 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:35,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:54:35,105 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:35,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,108 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:35,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,109 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:35,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,146 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:35,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,147 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:35,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,148 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:35,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:54:35,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:54:35,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:54:35,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:54:35,273 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [49061#(not (= 4 ~__unbuffered_cnt~0))] [2020-11-09 16:54:35,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:54:35,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:35,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:54:35,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:54:35,274 INFO L87 Difference]: Start difference. First operand 1786 states and 6634 transitions. Second operand 5 states. [2020-11-09 16:54:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:35,401 INFO L93 Difference]: Finished difference Result 1321 states and 4384 transitions. [2020-11-09 16:54:35,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:54:35,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 16:54:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:35,407 INFO L225 Difference]: With dead ends: 1321 [2020-11-09 16:54:35,407 INFO L226 Difference]: Without dead ends: 889 [2020-11-09 16:54:35,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:54:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2020-11-09 16:54:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 889. [2020-11-09 16:54:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2020-11-09 16:54:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 2690 transitions. [2020-11-09 16:54:35,438 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 2690 transitions. Word has length 15 [2020-11-09 16:54:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:35,439 INFO L481 AbstractCegarLoop]: Abstraction has 889 states and 2690 transitions. [2020-11-09 16:54:35,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:54:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 2690 transitions. [2020-11-09 16:54:35,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 16:54:35,441 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:35,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:54:35,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 16:54:35,442 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-11-09 16:54:35,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:35,442 INFO L82 PathProgramCache]: Analyzing trace with hash 679643642, now seen corresponding path program 1 times [2020-11-09 16:54:35,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:35,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495046927] [2020-11-09 16:54:35,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:35,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495046927] [2020-11-09 16:54:35,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:35,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:54:35,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [193584571] [2020-11-09 16:54:35,545 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:35,548 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:35,573 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 68 transitions. [2020-11-09 16:54:35,574 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:35,627 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:35,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,629 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:35,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,630 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:35,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,697 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:35,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,699 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:35,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,700 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:35,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:35,802 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [52170#(= ~z$w_buff1~0 0)] [2020-11-09 16:54:35,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:54:35,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:35,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:54:35,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:54:35,804 INFO L87 Difference]: Start difference. First operand 889 states and 2690 transitions. Second operand 6 states. [2020-11-09 16:54:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:35,933 INFO L93 Difference]: Finished difference Result 1250 states and 3667 transitions. [2020-11-09 16:54:35,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:54:35,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-09 16:54:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:35,938 INFO L225 Difference]: With dead ends: 1250 [2020-11-09 16:54:35,938 INFO L226 Difference]: Without dead ends: 900 [2020-11-09 16:54:35,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:54:35,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-11-09 16:54:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 868. [2020-11-09 16:54:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2020-11-09 16:54:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 2487 transitions. [2020-11-09 16:54:35,964 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 2487 transitions. Word has length 18 [2020-11-09 16:54:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:35,965 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 2487 transitions. [2020-11-09 16:54:35,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:54:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2487 transitions. [2020-11-09 16:54:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 16:54:35,968 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:35,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:54:35,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 16:54:35,969 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-11-09 16:54:35,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:35,969 INFO L82 PathProgramCache]: Analyzing trace with hash -555388612, now seen corresponding path program 1 times [2020-11-09 16:54:35,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:35,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509067808] [2020-11-09 16:54:35,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:36,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509067808] [2020-11-09 16:54:36,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:36,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:54:36,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1381898209] [2020-11-09 16:54:36,071 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:36,075 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:36,084 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 60 transitions. [2020-11-09 16:54:36,084 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:36,105 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,106 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,107 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:36,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,149 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,150 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,151 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:36,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,241 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:36,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,243 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,244 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:36,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,333 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [55167#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:54:36,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 16:54:36,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:36,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 16:54:36,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:54:36,335 INFO L87 Difference]: Start difference. First operand 868 states and 2487 transitions. Second operand 7 states. [2020-11-09 16:54:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:36,457 INFO L93 Difference]: Finished difference Result 755 states and 2130 transitions. [2020-11-09 16:54:36,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:54:36,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-11-09 16:54:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:36,462 INFO L225 Difference]: With dead ends: 755 [2020-11-09 16:54:36,462 INFO L226 Difference]: Without dead ends: 665 [2020-11-09 16:54:36,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:54:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-11-09 16:54:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 645. [2020-11-09 16:54:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2020-11-09 16:54:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1834 transitions. [2020-11-09 16:54:36,491 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1834 transitions. Word has length 18 [2020-11-09 16:54:36,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:36,491 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 1834 transitions. [2020-11-09 16:54:36,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 16:54:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1834 transitions. [2020-11-09 16:54:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 16:54:36,494 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:36,494 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-11-09 16:54:36,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 16:54:36,494 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-11-09 16:54:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:36,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1261416120, now seen corresponding path program 1 times [2020-11-09 16:54:36,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:36,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632352763] [2020-11-09 16:54:36,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:36,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632352763] [2020-11-09 16:54:36,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:36,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:54:36,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [696993014] [2020-11-09 16:54:36,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:36,600 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:36,628 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 223 transitions. [2020-11-09 16:54:36,628 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:36,640 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:36,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,642 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,642 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:36,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,720 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,722 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,723 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:36,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,757 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,758 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,759 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:36,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,794 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,795 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,796 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:36,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,829 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,830 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,831 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:36,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,871 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,872 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,873 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:36,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,904 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:36,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,905 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:36,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:36,906 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:36,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,264 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:54:37,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:54:37,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:37,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:54:37,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:54:37,266 INFO L87 Difference]: Start difference. First operand 645 states and 1834 transitions. Second operand 4 states. [2020-11-09 16:54:37,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:37,300 INFO L93 Difference]: Finished difference Result 852 states and 2354 transitions. [2020-11-09 16:54:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:54:37,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-09 16:54:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:37,305 INFO L225 Difference]: With dead ends: 852 [2020-11-09 16:54:37,305 INFO L226 Difference]: Without dead ends: 582 [2020-11-09 16:54:37,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-11-09 16:54:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-11-09 16:54:37,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 579. [2020-11-09 16:54:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2020-11-09 16:54:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1541 transitions. [2020-11-09 16:54:37,322 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1541 transitions. Word has length 21 [2020-11-09 16:54:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:37,323 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 1541 transitions. [2020-11-09 16:54:37,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:54:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1541 transitions. [2020-11-09 16:54:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 16:54:37,333 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:37,333 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-11-09 16:54:37,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 16:54:37,334 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-11-09 16:54:37,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:37,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1821973568, now seen corresponding path program 2 times [2020-11-09 16:54:37,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:37,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803083126] [2020-11-09 16:54:37,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:37,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803083126] [2020-11-09 16:54:37,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:37,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:54:37,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2098507896] [2020-11-09 16:54:37,462 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:37,465 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:37,482 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 85 transitions. [2020-11-09 16:54:37,482 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:37,505 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:37,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,506 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:37,507 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,507 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:37,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,544 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:37,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,545 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:37,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,546 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:37,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,588 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:37,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,589 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:37,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,590 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:37,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,637 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:37,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,638 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:37,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,639 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:37,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,675 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:37,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,678 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:37,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,679 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:37,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:37,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,712 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:37,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,713 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:37,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,759 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:37,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,760 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:37,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,761 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:37,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:37,789 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [59238#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:54:37,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 16:54:37,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 16:54:37,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:54:37,790 INFO L87 Difference]: Start difference. First operand 579 states and 1541 transitions. Second operand 8 states. [2020-11-09 16:54:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:37,941 INFO L93 Difference]: Finished difference Result 554 states and 1491 transitions. [2020-11-09 16:54:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 16:54:37,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-11-09 16:54:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:37,946 INFO L225 Difference]: With dead ends: 554 [2020-11-09 16:54:37,946 INFO L226 Difference]: Without dead ends: 179 [2020-11-09 16:54:37,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:54:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-11-09 16:54:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2020-11-09 16:54:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-11-09 16:54:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 445 transitions. [2020-11-09 16:54:37,952 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 445 transitions. Word has length 21 [2020-11-09 16:54:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:37,952 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 445 transitions. [2020-11-09 16:54:37,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 16:54:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 445 transitions. [2020-11-09 16:54:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-09 16:54:37,954 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:37,954 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] [2020-11-09 16:54:37,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 16:54:37,954 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-11-09 16:54:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:37,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1627508946, now seen corresponding path program 1 times [2020-11-09 16:54:37,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:37,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049172425] [2020-11-09 16:54:37,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:54:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:54:38,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049172425] [2020-11-09 16:54:38,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:54:38,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:54:38,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1087905581] [2020-11-09 16:54:38,345 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:54:38,349 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:54:38,398 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 134 transitions. [2020-11-09 16:54:38,398 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:54:38,411 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:54:38,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,412 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:38,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,415 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:38,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,417 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:38,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,418 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:38,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,477 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:54:38,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,477 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:38,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,481 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:38,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,482 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:38,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,483 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:38,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,555 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:54:38,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,556 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:38,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,560 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:38,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,562 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:54:38,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:54:38,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,633 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:38,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:38,634 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-11-09 16:54:38,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:54:38,635 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 5, 3, 2, 2, 1] term [2020-11-09 16:54:38,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,028 WARN L194 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 25 [2020-11-09 16:54:39,037 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:39,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,038 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-11-09 16:54:39,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:54:39,039 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 5, 3, 2, 2, 1] term [2020-11-09 16:54:39,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,171 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:39,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,173 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-11-09 16:54:39,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:54:39,174 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 5, 3, 2, 2, 1] term [2020-11-09 16:54:39,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,294 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:39,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,296 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-11-09 16:54:39,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:54:39,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 5, 3, 2, 2, 1] term [2020-11-09 16:54:39,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:39,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,403 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-11-09 16:54:39,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:54:39,404 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 5, 3, 2, 2, 1] term [2020-11-09 16:54:39,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,501 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:39,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,502 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-11-09 16:54:39,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:54:39,503 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 5, 3, 2, 2, 1] term [2020-11-09 16:54:39,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,600 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:39,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,601 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-11-09 16:54:39,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:54:39,602 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 5, 3, 2, 2, 1] term [2020-11-09 16:54:39,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,716 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:39,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,717 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-11-09 16:54:39,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:54:39,718 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 5, 3, 2, 2, 1] term [2020-11-09 16:54:39,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,836 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:54:39,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,837 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-11-09 16:54:39,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:54:39,838 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 5, 3, 2, 2, 1] term [2020-11-09 16:54:39,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:54:39,933 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [60161#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (or (< 0 (+ (div ~z$w_buff0_used~0 256) 1)) (not (= (mod ~z$w_buff0_used~0 256) 0))) (or (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (not (= (mod ~z$r_buff0_thd4~0 256) 0))))] [2020-11-09 16:54:39,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 16:54:39,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:54:39,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 16:54:39,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:54:39,935 INFO L87 Difference]: Start difference. First operand 179 states and 445 transitions. Second operand 9 states. [2020-11-09 16:54:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:54:40,284 INFO L93 Difference]: Finished difference Result 263 states and 646 transitions. [2020-11-09 16:54:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 16:54:40,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-11-09 16:54:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:54:40,287 INFO L225 Difference]: With dead ends: 263 [2020-11-09 16:54:40,287 INFO L226 Difference]: Without dead ends: 161 [2020-11-09 16:54:40,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 11 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-11-09 16:54:40,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-09 16:54:40,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2020-11-09 16:54:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-11-09 16:54:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 317 transitions. [2020-11-09 16:54:40,292 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 317 transitions. Word has length 25 [2020-11-09 16:54:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:54:40,292 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 317 transitions. [2020-11-09 16:54:40,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 16:54:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 317 transitions. [2020-11-09 16:54:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-09 16:54:40,293 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:54:40,293 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] [2020-11-09 16:54:40,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 16:54:40,294 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-11-09 16:54:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:54:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash 91777140, now seen corresponding path program 2 times [2020-11-09 16:54:40,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:54:40,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054354768] [2020-11-09 16:54:40,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:54:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:54:40,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:54:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:54:40,383 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:54:40,428 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 16:54:40,428 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 16:54:40,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 16:54:40,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:54:40 BasicIcfg [2020-11-09 16:54:40,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 16:54:40,540 INFO L168 Benchmark]: Toolchain (without parser) took 55238.53 ms. Allocated memory was 153.1 MB in the beginning and 267.4 MB in the end (delta: 114.3 MB). Free memory was 126.7 MB in the beginning and 128.8 MB in the end (delta: -2.1 MB). Peak memory consumption was 113.0 MB. Max. memory is 8.0 GB. [2020-11-09 16:54:40,541 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 153.1 MB. Free memory was 125.6 MB in the beginning and 125.5 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:54:40,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1042.94 ms. Allocated memory is still 153.1 MB. Free memory was 126.0 MB in the beginning and 124.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 28.7 MB. Max. memory is 8.0 GB. [2020-11-09 16:54:40,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.63 ms. Allocated memory is still 153.1 MB. Free memory was 124.5 MB in the beginning and 121.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:54:40,542 INFO L168 Benchmark]: Boogie Preprocessor took 44.58 ms. Allocated memory is still 153.1 MB. Free memory was 121.3 MB in the beginning and 119.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:54:40,543 INFO L168 Benchmark]: RCFGBuilder took 2568.13 ms. Allocated memory was 153.1 MB in the beginning and 184.5 MB in the end (delta: 31.5 MB). Free memory was 119.2 MB in the beginning and 104.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 79.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:54:40,544 INFO L168 Benchmark]: TraceAbstraction took 51440.47 ms. Allocated memory was 184.5 MB in the beginning and 267.4 MB in the end (delta: 82.8 MB). Free memory was 104.0 MB in the beginning and 128.8 MB in the end (delta: -24.8 MB). Peak memory consumption was 57.5 MB. Max. memory is 8.0 GB. [2020-11-09 16:54:40,547 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.31 ms. Allocated memory is still 153.1 MB. Free memory was 125.6 MB in the beginning and 125.5 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1042.94 ms. Allocated memory is still 153.1 MB. Free memory was 126.0 MB in the beginning and 124.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 28.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 126.63 ms. Allocated memory is still 153.1 MB. Free memory was 124.5 MB in the beginning and 121.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.58 ms. Allocated memory is still 153.1 MB. Free memory was 121.3 MB in the beginning and 119.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2568.13 ms. Allocated memory was 153.1 MB in the beginning and 184.5 MB in the end (delta: 31.5 MB). Free memory was 119.2 MB in the beginning and 104.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 79.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 51440.47 ms. Allocated memory was 184.5 MB in the beginning and 267.4 MB in the end (delta: 82.8 MB). Free memory was 104.0 MB in the beginning and 128.8 MB in the end (delta: -24.8 MB). Peak memory consumption was 57.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1410 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 119 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 40.6s, 127 PlacesBefore, 44 PlacesAfterwards, 117 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 6769 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1469; [L837] FCALL, FORK 0 pthread_create(&t1469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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] [L838] 0 pthread_t t1470; [L839] FCALL, FORK 0 pthread_create(&t1470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L840] 0 pthread_t t1471; [L841] FCALL, FORK 0 pthread_create(&t1471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L842] 0 pthread_t t1472; [L843] FCALL, FORK 0 pthread_create(&t1472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L778] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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] [L814] 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) [L814] 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) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 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 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 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 [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L784] 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) [L784] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L784] 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) [L784] 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) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 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 [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 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 [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L849] 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) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] 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) [L849] 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) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 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 [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 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 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 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) [L860] 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) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 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)) [L864] 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)) [L865] 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)) [L865] 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)) [L866] 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)) [L866] 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)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix055_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, 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, 115 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 51.1s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 40.8s, HoareTripleCheckerStatistics: 423 SDtfs, 521 SDslu, 731 SDs, 0 SdLazy, 320 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 190 SyntacticMatches, 26 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 93 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 25546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...