/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-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:22:59,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:22:59,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:22:59,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:22:59,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:22:59,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:22:59,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:22:59,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:22:59,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:22:59,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:22:59,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:22:59,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:22:59,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:22:59,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:22:59,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:22:59,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:22:59,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:22:59,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:22:59,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:22:59,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:22:59,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:22:59,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:22:59,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:22:59,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:22:59,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:22:59,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:22:59,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:22:59,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:22:59,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:22:59,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:22:59,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:22:59,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:22:59,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:22:59,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:22:59,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:22:59,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:22:59,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:22:59,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:22:59,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:22:59,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:22:59,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:22:59,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-11-09 15:22:59,519 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:22:59,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:22:59,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:22:59,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:22:59,525 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:22:59,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:22:59,525 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:22:59,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:22:59,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:22:59,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:22:59,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:22:59,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:22:59,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:22:59,528 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:22:59,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:22:59,528 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:22:59,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:22:59,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:22:59,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:22:59,529 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:22:59,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:22:59,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:22:59,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:22:59,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:22:59,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:22:59,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:22:59,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:22:59,531 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:22:59,531 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:22:59,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:22:59,532 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 15:22:59,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:22:59,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:22:59,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:22:59,997 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:22:59,998 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:22:59,999 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2020-11-09 15:23:00,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1823f26ad/e199c1df9bec4890a65488c4749aac43/FLAG13e6cd168 [2020-11-09 15:23:00,931 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:23:00,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2020-11-09 15:23:00,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1823f26ad/e199c1df9bec4890a65488c4749aac43/FLAG13e6cd168 [2020-11-09 15:23:01,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1823f26ad/e199c1df9bec4890a65488c4749aac43 [2020-11-09 15:23:01,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:23:01,224 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:23:01,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:23:01,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:23:01,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:23:01,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:23:01" (1/1) ... [2020-11-09 15:23:01,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f3e749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:01, skipping insertion in model container [2020-11-09 15:23:01,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:23:01" (1/1) ... [2020-11-09 15:23:01,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:23:01,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:23:01,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:23:01,825 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:23:01,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:23:02,046 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:23:02,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:02 WrapperNode [2020-11-09 15:23:02,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:23:02,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:23:02,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:23:02,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:23:02,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:02" (1/1) ... [2020-11-09 15:23:02,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:02" (1/1) ... [2020-11-09 15:23:02,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:23:02,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:23:02,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:23:02,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:23:02,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:02" (1/1) ... [2020-11-09 15:23:02,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:02" (1/1) ... [2020-11-09 15:23:02,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:02" (1/1) ... [2020-11-09 15:23:02,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:02" (1/1) ... [2020-11-09 15:23:02,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:02" (1/1) ... [2020-11-09 15:23:02,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:02" (1/1) ... [2020-11-09 15:23:02,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:02" (1/1) ... [2020-11-09 15:23:02,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:23:02,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:23:02,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:23:02,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:23:02,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:02" (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 15:23:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:23:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:23:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:23:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:23:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:23:02,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:23:02,275 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:23:02,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:23:02,276 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 15:23:02,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 15:23:02,277 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-09 15:23:02,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-09 15:23:02,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:23:02,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:23:02,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:23:02,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:23:02,282 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 15:23:04,716 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:23:04,716 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:23:04,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:23:04 BoogieIcfgContainer [2020-11-09 15:23:04,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:23:04,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:23:04,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:23:04,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:23:04,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:23:01" (1/3) ... [2020-11-09 15:23:04,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218e585a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:23:04, skipping insertion in model container [2020-11-09 15:23:04,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:02" (2/3) ... [2020-11-09 15:23:04,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218e585a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:23:04, skipping insertion in model container [2020-11-09 15:23:04,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:23:04" (3/3) ... [2020-11-09 15:23:04,727 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i [2020-11-09 15:23:04,744 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:23:04,744 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:23:04,748 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:23:04,749 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:23:04,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,791 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,791 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,791 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,792 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,793 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,794 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,794 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,794 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,796 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,796 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,797 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,797 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,802 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,802 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,802 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,802 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,802 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,803 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,803 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,803 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,803 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,803 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,804 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,804 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,804 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,804 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,804 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,804 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,805 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,806 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,807 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,807 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,807 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,809 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,809 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,809 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,814 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,815 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,823 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,824 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,825 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,826 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,828 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,828 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,830 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:23:04,832 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:23:04,846 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 15:23:04,870 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:23:04,870 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:23:04,871 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:23:04,871 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:23:04,871 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:23:04,871 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:23:04,871 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:23:04,871 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:23:04,886 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:23:04,887 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-09 15:23:04,891 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-09 15:23:04,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-11-09 15:23:04,950 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-11-09 15:23:04,951 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:23:04,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-09 15:23:04,965 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-11-09 15:23:06,072 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 15:23:06,216 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-11-09 15:23:06,416 WARN L194 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-11-09 15:23:08,987 WARN L194 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-11-09 15:23:09,117 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-09 15:23:09,717 WARN L194 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2020-11-09 15:23:09,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:23:09,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:23:10,222 WARN L194 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2020-11-09 15:23:10,703 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-09 15:23:10,896 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-09 15:23:11,476 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 15:23:11,589 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 15:23:11,703 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 15:23:11,827 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 15:23:12,371 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 15:23:12,501 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 15:23:12,631 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 15:23:12,779 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 15:23:13,435 WARN L194 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-09 15:23:13,729 WARN L194 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-09 15:23:14,301 WARN L194 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-09 15:23:14,589 WARN L194 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-09 15:23:14,606 INFO L131 LiptonReduction]: Checked pairs total: 8162 [2020-11-09 15:23:14,606 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-11-09 15:23:14,616 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2020-11-09 15:23:14,969 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4122 states. [2020-11-09 15:23:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states. [2020-11-09 15:23:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 15:23:14,984 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:14,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:23:14,986 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 15:23:14,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:14,998 INFO L82 PathProgramCache]: Analyzing trace with hash 284962156, now seen corresponding path program 1 times [2020-11-09 15:23:15,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:15,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768663812] [2020-11-09 15:23:15,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:15,481 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 15:23:15,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768663812] [2020-11-09 15:23:15,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:15,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:23:15,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [387826511] [2020-11-09 15:23:15,486 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:15,491 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:15,514 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 15:23:15,514 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:15,520 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:23:15,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:23:15,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:15,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:23:15,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:23:15,545 INFO L87 Difference]: Start difference. First operand 4122 states. Second operand 3 states. [2020-11-09 15:23:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:15,749 INFO L93 Difference]: Finished difference Result 3562 states and 14032 transitions. [2020-11-09 15:23:15,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:23:15,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 15:23:15,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:15,825 INFO L225 Difference]: With dead ends: 3562 [2020-11-09 15:23:15,825 INFO L226 Difference]: Without dead ends: 2602 [2020-11-09 15:23:15,826 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 15:23:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-11-09 15:23:16,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-11-09 15:23:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-11-09 15:23:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-11-09 15:23:16,102 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-11-09 15:23:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:16,104 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-11-09 15:23:16,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:23:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-11-09 15:23:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 15:23:16,108 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:16,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:23:16,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:23:16,109 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 15:23:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:16,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1841214313, now seen corresponding path program 1 times [2020-11-09 15:23:16,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:16,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593044468] [2020-11-09 15:23:16,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:16,312 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 15:23:16,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593044468] [2020-11-09 15:23:16,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:16,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:23:16,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [290261223] [2020-11-09 15:23:16,314 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:16,317 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:16,321 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2020-11-09 15:23:16,321 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:16,322 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:23:16,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:23:16,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:23:16,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:23:16,325 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-11-09 15:23:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:16,418 INFO L93 Difference]: Finished difference Result 2762 states and 10352 transitions. [2020-11-09 15:23:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:23:16,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-09 15:23:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:16,441 INFO L225 Difference]: With dead ends: 2762 [2020-11-09 15:23:16,442 INFO L226 Difference]: Without dead ends: 2282 [2020-11-09 15:23:16,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:23:16,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-11-09 15:23:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-11-09 15:23:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-11-09 15:23:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-11-09 15:23:16,697 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 12 [2020-11-09 15:23:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:16,697 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-11-09 15:23:16,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:23:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-11-09 15:23:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:23:16,704 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:16,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:23:16,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:23:16,705 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 15:23:16,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:16,715 INFO L82 PathProgramCache]: Analyzing trace with hash -395911163, now seen corresponding path program 1 times [2020-11-09 15:23:16,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:16,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781478998] [2020-11-09 15:23:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:16,903 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 15:23:16,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781478998] [2020-11-09 15:23:16,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:16,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:23:16,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [306047028] [2020-11-09 15:23:16,904 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:16,909 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:16,913 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 20 transitions. [2020-11-09 15:23:16,913 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:17,014 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:23:17,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:23:17,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:17,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:23:17,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:23:17,016 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 4 states. [2020-11-09 15:23:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:17,096 INFO L93 Difference]: Finished difference Result 2538 states and 9408 transitions. [2020-11-09 15:23:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:23:17,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-09 15:23:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:17,119 INFO L225 Difference]: With dead ends: 2538 [2020-11-09 15:23:17,119 INFO L226 Difference]: Without dead ends: 2218 [2020-11-09 15:23:17,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 15:23:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-11-09 15:23:17,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-11-09 15:23:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-11-09 15:23:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-11-09 15:23:17,228 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2020-11-09 15:23:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:17,228 INFO L481 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-11-09 15:23:17,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:23:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-11-09 15:23:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:23:17,232 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:17,233 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:23:17,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:23:17,233 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 15:23:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 552661006, now seen corresponding path program 1 times [2020-11-09 15:23:17,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:17,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229815701] [2020-11-09 15:23:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:17,394 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 15:23:17,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229815701] [2020-11-09 15:23:17,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:17,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:23:17,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1029689013] [2020-11-09 15:23:17,396 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:17,399 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:17,406 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 42 transitions. [2020-11-09 15:23:17,406 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:17,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:23:17,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:23:17,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:17,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:23:17,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:23:17,644 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 4 states. [2020-11-09 15:23:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:17,720 INFO L93 Difference]: Finished difference Result 2410 states and 8912 transitions. [2020-11-09 15:23:17,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:23:17,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-09 15:23:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:17,743 INFO L225 Difference]: With dead ends: 2410 [2020-11-09 15:23:17,743 INFO L226 Difference]: Without dead ends: 2154 [2020-11-09 15:23:17,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 15:23:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-11-09 15:23:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-11-09 15:23:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-11-09 15:23:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-11-09 15:23:17,859 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 15 [2020-11-09 15:23:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:17,859 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-11-09 15:23:17,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:23:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-11-09 15:23:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:23:17,864 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:17,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:23:17,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:23:17,865 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 15:23:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:17,866 INFO L82 PathProgramCache]: Analyzing trace with hash -47248263, now seen corresponding path program 1 times [2020-11-09 15:23:17,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:17,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319902414] [2020-11-09 15:23:17,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:18,129 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 15:23:18,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319902414] [2020-11-09 15:23:18,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:18,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:23:18,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [196661260] [2020-11-09 15:23:18,131 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:18,136 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:18,151 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 100 transitions. [2020-11-09 15:23:18,152 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:18,160 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:18,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:18,161 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:18,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:18,279 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:18,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:18,284 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:18,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:18,339 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:18,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:18,343 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:18,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:18,407 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:18,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:18,408 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:18,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:18,473 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:18,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:18,478 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:18,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:18,520 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:18,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:18,522 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:18,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:18,704 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:23:18,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:23:18,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:18,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:23:18,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:23:18,706 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 6 states. [2020-11-09 15:23:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:18,818 INFO L93 Difference]: Finished difference Result 2322 states and 8524 transitions. [2020-11-09 15:23:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:23:18,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-09 15:23:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:18,839 INFO L225 Difference]: With dead ends: 2322 [2020-11-09 15:23:18,839 INFO L226 Difference]: Without dead ends: 2066 [2020-11-09 15:23:18,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:23:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2020-11-09 15:23:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2066. [2020-11-09 15:23:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2066 states. [2020-11-09 15:23:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 7728 transitions. [2020-11-09 15:23:18,931 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 7728 transitions. Word has length 16 [2020-11-09 15:23:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:18,932 INFO L481 AbstractCegarLoop]: Abstraction has 2066 states and 7728 transitions. [2020-11-09 15:23:18,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:23:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 7728 transitions. [2020-11-09 15:23:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 15:23:18,937 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:18,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:23:18,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:23:18,938 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 15:23:18,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:18,939 INFO L82 PathProgramCache]: Analyzing trace with hash -4480891, now seen corresponding path program 1 times [2020-11-09 15:23:18,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:18,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504436534] [2020-11-09 15:23:18,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:19,166 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 15:23:19,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504436534] [2020-11-09 15:23:19,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:19,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:23:19,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1406623228] [2020-11-09 15:23:19,168 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:19,173 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:19,188 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 130 transitions. [2020-11-09 15:23:19,189 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:19,194 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:23:19,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:19,199 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:23:19,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:19,249 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:23:19,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:19,251 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:23:19,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:19,448 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:23:19,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:19,451 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:23:19,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:19,589 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [44651#(and (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), 44652#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0))] [2020-11-09 15:23:19,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 15:23:19,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:19,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 15:23:19,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:23:19,591 INFO L87 Difference]: Start difference. First operand 2066 states and 7728 transitions. Second operand 9 states. [2020-11-09 15:23:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:19,806 INFO L93 Difference]: Finished difference Result 2574 states and 9448 transitions. [2020-11-09 15:23:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:23:19,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-11-09 15:23:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:19,829 INFO L225 Difference]: With dead ends: 2574 [2020-11-09 15:23:19,829 INFO L226 Difference]: Without dead ends: 2378 [2020-11-09 15:23:19,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-11-09 15:23:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2020-11-09 15:23:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2226. [2020-11-09 15:23:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2020-11-09 15:23:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 8304 transitions. [2020-11-09 15:23:19,928 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 8304 transitions. Word has length 17 [2020-11-09 15:23:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:19,928 INFO L481 AbstractCegarLoop]: Abstraction has 2226 states and 8304 transitions. [2020-11-09 15:23:19,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 15:23:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 8304 transitions. [2020-11-09 15:23:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 15:23:19,934 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:19,934 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:23:19,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:23:19,934 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 15:23:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2119478795, now seen corresponding path program 2 times [2020-11-09 15:23:19,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:19,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595572120] [2020-11-09 15:23:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:20,106 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 15:23:20,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595572120] [2020-11-09 15:23:20,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:20,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:23:20,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [572044953] [2020-11-09 15:23:20,107 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:20,111 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:20,120 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 67 transitions. [2020-11-09 15:23:20,121 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:20,141 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 15:23:20,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:20,142 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:23:20,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:20,281 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [51690#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))] [2020-11-09 15:23:20,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:23:20,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:23:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:23:20,283 INFO L87 Difference]: Start difference. First operand 2226 states and 8304 transitions. Second operand 8 states. [2020-11-09 15:23:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:20,471 INFO L93 Difference]: Finished difference Result 2394 states and 8754 transitions. [2020-11-09 15:23:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:23:20,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-11-09 15:23:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:20,496 INFO L225 Difference]: With dead ends: 2394 [2020-11-09 15:23:20,497 INFO L226 Difference]: Without dead ends: 2226 [2020-11-09 15:23:20,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:23:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2020-11-09 15:23:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2106. [2020-11-09 15:23:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-11-09 15:23:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7832 transitions. [2020-11-09 15:23:20,593 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7832 transitions. Word has length 17 [2020-11-09 15:23:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:20,593 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7832 transitions. [2020-11-09 15:23:20,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:23:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7832 transitions. [2020-11-09 15:23:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 15:23:20,600 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:20,600 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 15:23:20,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:23:20,600 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 15:23:20,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1349936792, now seen corresponding path program 1 times [2020-11-09 15:23:20,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:20,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874437527] [2020-11-09 15:23:20,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:20,856 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 15:23:20,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874437527] [2020-11-09 15:23:20,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:20,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:23:20,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [460596875] [2020-11-09 15:23:20,857 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:20,863 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:20,883 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 150 transitions. [2020-11-09 15:23:20,883 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:20,890 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:23:20,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:20,891 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:23:20,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:21,104 WARN L194 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 23 [2020-11-09 15:23:21,122 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:23:21,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:21,123 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:23:21,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:21,125 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:21,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:21,128 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 3, 5, 2, 1] term [2020-11-09 15:23:21,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:21,131 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:23:21,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:21,605 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 26 [2020-11-09 15:23:21,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:23:21,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:21,621 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:23:21,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:21,692 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:23:21,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:21,693 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:23:21,693 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:21,696 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:21,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:21,698 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 3, 5, 2, 1] term [2020-11-09 15:23:21,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:21,700 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:23:21,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,086 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:23:22,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,087 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:23:22,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,092 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:22,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,094 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 3, 5, 2, 1] term [2020-11-09 15:23:22,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:22,095 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:23:22,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,397 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:23:22,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,398 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:23:22,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,401 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:22,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,403 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:22,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:22,404 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:23:22,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,405 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 3, 5, 2, 1] term [2020-11-09 15:23:22,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:22,407 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 5, 3, 5, 2, 1] term [2020-11-09 15:23:22,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:22,685 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:23:22,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,687 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:23:22,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,736 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:23:22,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,737 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:23:22,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,744 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:22,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,746 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:22,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:22,747 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:23:22,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:22,748 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 3, 5, 2, 1] term [2020-11-09 15:23:22,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:22,749 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 5, 3, 5, 2, 1] term [2020-11-09 15:23:22,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:23,025 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:23:23,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:23,026 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:23:23,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:23,030 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:23,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:23,031 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:23,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:23,034 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:23:23,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:23,035 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 5, 3, 5, 2, 1] term [2020-11-09 15:23:23,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:23,036 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 3, 5, 2, 1] term [2020-11-09 15:23:23,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:23,318 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:23:23,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:23,319 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:23:23,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:23,322 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:23,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:23,323 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:23,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:23,325 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:23,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:23,692 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [58309#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (or (not (= ~z$w_buff0~0 ~z~0)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (or (not (= ~z$w_buff0~0 ~z~0)) (not (= (mod ~z$r_buff1_thd0~0 256) 0))) (= ~z$w_buff0~0 2)), 58310#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (or (not (= ~z$w_buff0~0 ~z~0)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (or (not (= ~z$w_buff0~0 ~z~0)) (not (= (mod ~z$r_buff1_thd0~0 256) 0))) (= ~z$w_buff0~0 2)), 58311#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (= ~z$w_buff0~0 2)), 58312#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (not (= 2 ~z~0))), 58313#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0)), 58314#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$r_buff0_thd3~0 0) (not (= 2 ~z~0)))] [2020-11-09 15:23:23,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 15:23:23,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:23,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 15:23:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-11-09 15:23:23,694 INFO L87 Difference]: Start difference. First operand 2106 states and 7832 transitions. Second operand 14 states. [2020-11-09 15:23:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:23,941 INFO L93 Difference]: Finished difference Result 3082 states and 11124 transitions. [2020-11-09 15:23:23,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:23:23,942 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-11-09 15:23:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:23,954 INFO L225 Difference]: With dead ends: 3082 [2020-11-09 15:23:23,954 INFO L226 Difference]: Without dead ends: 2626 [2020-11-09 15:23:23,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 15 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-11-09 15:23:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2020-11-09 15:23:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2362. [2020-11-09 15:23:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2020-11-09 15:23:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 8664 transitions. [2020-11-09 15:23:24,076 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 8664 transitions. Word has length 18 [2020-11-09 15:23:24,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:24,076 INFO L481 AbstractCegarLoop]: Abstraction has 2362 states and 8664 transitions. [2020-11-09 15:23:24,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 15:23:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 8664 transitions. [2020-11-09 15:23:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 15:23:24,083 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:24,083 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 15:23:24,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:23:24,083 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 15:23:24,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:24,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1797912376, now seen corresponding path program 1 times [2020-11-09 15:23:24,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:24,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5311200] [2020-11-09 15:23:24,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:24,232 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 15:23:24,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5311200] [2020-11-09 15:23:24,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:24,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:23:24,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [393822881] [2020-11-09 15:23:24,233 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:24,237 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:24,255 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 140 transitions. [2020-11-09 15:23:24,256 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:24,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:23:24,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:23:24,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:23:24,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:23:24,400 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:24,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:24,401 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:24,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:24,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:24,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:24,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:23:24,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:23:24,474 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:24,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:24,475 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:24,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:24,476 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:24,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:24,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:23:24,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:23:24,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:23:24,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:23:24,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:23:24,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:23:24,645 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:23:24,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:24,668 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:23:24,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:24,711 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [66129#(= (mod ~main$tmp_guard0~0 256) 0), 66130#(not (= 4 ~__unbuffered_cnt~0))] [2020-11-09 15:23:24,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:23:24,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:24,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:23:24,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:23:24,713 INFO L87 Difference]: Start difference. First operand 2362 states and 8664 transitions. Second operand 6 states. [2020-11-09 15:23:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:24,780 INFO L93 Difference]: Finished difference Result 1738 states and 5659 transitions. [2020-11-09 15:23:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:23:24,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-09 15:23:24,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:24,787 INFO L225 Difference]: With dead ends: 1738 [2020-11-09 15:23:24,787 INFO L226 Difference]: Without dead ends: 1162 [2020-11-09 15:23:24,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:23:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-11-09 15:23:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2020-11-09 15:23:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2020-11-09 15:23:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 3446 transitions. [2020-11-09 15:23:24,829 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 3446 transitions. Word has length 18 [2020-11-09 15:23:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:24,829 INFO L481 AbstractCegarLoop]: Abstraction has 1162 states and 3446 transitions. [2020-11-09 15:23:24,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:23:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 3446 transitions. [2020-11-09 15:23:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 15:23:24,833 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:24,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:23:24,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:23:24,834 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 15:23:24,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:24,834 INFO L82 PathProgramCache]: Analyzing trace with hash -525600601, now seen corresponding path program 1 times [2020-11-09 15:23:24,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:24,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114908385] [2020-11-09 15:23:24,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:24,919 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 15:23:24,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114908385] [2020-11-09 15:23:24,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:24,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:23:24,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1087013127] [2020-11-09 15:23:24,920 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:24,925 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:24,937 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 68 transitions. [2020-11-09 15:23:24,937 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:24,989 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:23:24,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:23:24,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:24,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:23:24,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:23:24,990 INFO L87 Difference]: Start difference. First operand 1162 states and 3446 transitions. Second operand 4 states. [2020-11-09 15:23:25,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:25,041 INFO L93 Difference]: Finished difference Result 1733 states and 4960 transitions. [2020-11-09 15:23:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:23:25,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-09 15:23:25,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:25,047 INFO L225 Difference]: With dead ends: 1733 [2020-11-09 15:23:25,047 INFO L226 Difference]: Without dead ends: 1190 [2020-11-09 15:23:25,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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 15:23:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-11-09 15:23:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1150. [2020-11-09 15:23:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2020-11-09 15:23:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 3230 transitions. [2020-11-09 15:23:25,085 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 3230 transitions. Word has length 20 [2020-11-09 15:23:25,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:25,086 INFO L481 AbstractCegarLoop]: Abstraction has 1150 states and 3230 transitions. [2020-11-09 15:23:25,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:23:25,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 3230 transitions. [2020-11-09 15:23:25,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:23:25,089 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:25,089 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 15:23:25,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 15:23:25,090 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 15:23:25,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash 905378528, now seen corresponding path program 1 times [2020-11-09 15:23:25,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:25,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056315956] [2020-11-09 15:23:25,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:25,170 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 15:23:25,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056315956] [2020-11-09 15:23:25,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:25,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:23:25,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [590068021] [2020-11-09 15:23:25,171 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:25,175 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:25,197 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 149 transitions. [2020-11-09 15:23:25,198 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:25,245 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:25,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,246 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:25,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,247 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:25,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,313 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:25,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,314 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:25,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,315 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:25,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,365 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:25,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,366 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:25,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,367 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:25,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:25,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,397 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:25,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,398 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:25,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,502 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:23:25,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:23:25,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:25,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:23:25,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:23:25,504 INFO L87 Difference]: Start difference. First operand 1150 states and 3230 transitions. Second operand 5 states. [2020-11-09 15:23:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:25,564 INFO L93 Difference]: Finished difference Result 1567 states and 4279 transitions. [2020-11-09 15:23:25,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:23:25,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-09 15:23:25,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:25,569 INFO L225 Difference]: With dead ends: 1567 [2020-11-09 15:23:25,569 INFO L226 Difference]: Without dead ends: 1031 [2020-11-09 15:23:25,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:23:25,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2020-11-09 15:23:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 989. [2020-11-09 15:23:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2020-11-09 15:23:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 2629 transitions. [2020-11-09 15:23:25,606 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 2629 transitions. Word has length 21 [2020-11-09 15:23:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:25,606 INFO L481 AbstractCegarLoop]: Abstraction has 989 states and 2629 transitions. [2020-11-09 15:23:25,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:23:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 2629 transitions. [2020-11-09 15:23:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:23:25,610 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:25,610 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 15:23:25,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 15:23:25,610 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 15:23:25,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:25,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1597707145, now seen corresponding path program 1 times [2020-11-09 15:23:25,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:25,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148582553] [2020-11-09 15:23:25,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:25,780 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 15:23:25,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148582553] [2020-11-09 15:23:25,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:25,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:23:25,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1638564480] [2020-11-09 15:23:25,782 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:25,789 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:25,823 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 163 transitions. [2020-11-09 15:23:25,823 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:25,831 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:25,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,834 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:25,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,971 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:25,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,972 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:25,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,974 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:25,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,976 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 15:23:25,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:25,977 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:23:25,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,012 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 15:23:26,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,013 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:23:26,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,017 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,018 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,020 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:26,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,087 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,088 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,089 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:26,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,091 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 15:23:26,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,092 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:23:26,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,167 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:26,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,169 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,170 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:26,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,172 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 15:23:26,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,172 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:23:26,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,199 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,200 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:26,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,203 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 15:23:26,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,204 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:23:26,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,236 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 15:23:26,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,237 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:23:26,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,239 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:26,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,240 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,241 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:26,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,291 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 15:23:26,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,292 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:23:26,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,295 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:26,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,342 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,343 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,344 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:26,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,346 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 15:23:26,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,346 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:23:26,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,418 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:23:26,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:23:26,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:26,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:23:26,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:23:26,420 INFO L87 Difference]: Start difference. First operand 989 states and 2629 transitions. Second operand 8 states. [2020-11-09 15:23:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:26,603 INFO L93 Difference]: Finished difference Result 1188 states and 3077 transitions. [2020-11-09 15:23:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:23:26,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-11-09 15:23:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:26,609 INFO L225 Difference]: With dead ends: 1188 [2020-11-09 15:23:26,609 INFO L226 Difference]: Without dead ends: 1075 [2020-11-09 15:23:26,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-09 15:23:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2020-11-09 15:23:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 862. [2020-11-09 15:23:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2020-11-09 15:23:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 2259 transitions. [2020-11-09 15:23:26,635 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 2259 transitions. Word has length 21 [2020-11-09 15:23:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:26,635 INFO L481 AbstractCegarLoop]: Abstraction has 862 states and 2259 transitions. [2020-11-09 15:23:26,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:23:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 2259 transitions. [2020-11-09 15:23:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:23:26,637 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:26,637 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 15:23:26,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 15:23:26,638 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 15:23:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash -851137423, now seen corresponding path program 2 times [2020-11-09 15:23:26,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:26,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013985754] [2020-11-09 15:23:26,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:26,730 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 15:23:26,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013985754] [2020-11-09 15:23:26,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:26,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:23:26,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [439069594] [2020-11-09 15:23:26,732 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:26,737 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:26,757 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 129 transitions. [2020-11-09 15:23:26,757 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:26,772 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,774 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:26,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,813 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:26,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,814 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:26,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,815 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:26,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:26,842 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:23:26,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:23:26,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:26,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:23:26,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:23:26,843 INFO L87 Difference]: Start difference. First operand 862 states and 2259 transitions. Second operand 4 states. [2020-11-09 15:23:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:26,884 INFO L93 Difference]: Finished difference Result 1243 states and 3096 transitions. [2020-11-09 15:23:26,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:23:26,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-09 15:23:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:26,887 INFO L225 Difference]: With dead ends: 1243 [2020-11-09 15:23:26,888 INFO L226 Difference]: Without dead ends: 864 [2020-11-09 15:23:26,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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 15:23:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2020-11-09 15:23:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 828. [2020-11-09 15:23:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2020-11-09 15:23:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 2032 transitions. [2020-11-09 15:23:26,912 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 2032 transitions. Word has length 21 [2020-11-09 15:23:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:26,914 INFO L481 AbstractCegarLoop]: Abstraction has 828 states and 2032 transitions. [2020-11-09 15:23:26,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:23:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 2032 transitions. [2020-11-09 15:23:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:23:26,918 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:26,918 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 15:23:26,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 15:23:26,919 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 15:23:26,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1527121136, now seen corresponding path program 1 times [2020-11-09 15:23:26,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:26,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917566223] [2020-11-09 15:23:26,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:27,038 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 15:23:27,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917566223] [2020-11-09 15:23:27,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:27,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:23:27,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331083274] [2020-11-09 15:23:27,039 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:27,043 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:27,066 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 140 transitions. [2020-11-09 15:23:27,066 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:27,077 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:27,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,078 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:27,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,079 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:27,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,245 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:23:27,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,301 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [83630#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 15:23:27,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:23:27,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:23:27,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:23:27,303 INFO L87 Difference]: Start difference. First operand 828 states and 2032 transitions. Second operand 7 states. [2020-11-09 15:23:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:27,364 INFO L93 Difference]: Finished difference Result 679 states and 1613 transitions. [2020-11-09 15:23:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:23:27,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-09 15:23:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:27,366 INFO L225 Difference]: With dead ends: 679 [2020-11-09 15:23:27,366 INFO L226 Difference]: Without dead ends: 429 [2020-11-09 15:23:27,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 9 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:23:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-11-09 15:23:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2020-11-09 15:23:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2020-11-09 15:23:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 947 transitions. [2020-11-09 15:23:27,377 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 947 transitions. Word has length 21 [2020-11-09 15:23:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:27,377 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 947 transitions. [2020-11-09 15:23:27,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:23:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 947 transitions. [2020-11-09 15:23:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-09 15:23:27,379 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:27,379 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:23:27,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 15:23:27,379 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 15:23:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1886708776, now seen corresponding path program 1 times [2020-11-09 15:23:27,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:27,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953177963] [2020-11-09 15:23:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:27,548 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 15:23:27,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953177963] [2020-11-09 15:23:27,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:27,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:23:27,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1710505046] [2020-11-09 15:23:27,549 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:27,554 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:27,632 INFO L252 McrAutomatonBuilder]: Finished intersection with 201 states and 462 transitions. [2020-11-09 15:23:27,632 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:27,664 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:27,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,665 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:27,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,666 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:27,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,668 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 3, 1] term [2020-11-09 15:23:27,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:27,669 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:23:27,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,824 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:27,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,825 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:27,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,827 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:27,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,828 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 3, 1] term [2020-11-09 15:23:27,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:27,829 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:23:27,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,975 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:27,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,975 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:27,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,977 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:27,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,978 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:27,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:27,979 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:23:27,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:27,980 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 3, 3, 1] term [2020-11-09 15:23:27,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:27,981 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 3, 1] term [2020-11-09 15:23:27,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:28,133 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:28,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,134 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:28,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,135 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:28,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,137 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 3, 1] term [2020-11-09 15:23:28,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:28,138 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:23:28,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:28,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:28,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,299 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:28,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 3, 1] term [2020-11-09 15:23:28,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:28,301 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:23:28,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,504 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:28,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,504 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:28,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,506 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:28,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,507 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:28,507 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:28,508 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:23:28,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 3, 3, 1] term [2020-11-09 15:23:28,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:28,510 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 3, 1] term [2020-11-09 15:23:28,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:28,706 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:28,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,707 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:28,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,708 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:28,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:28,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:28,711 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:23:28,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,711 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 3, 3, 1] term [2020-11-09 15:23:28,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:28,712 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 3, 1] term [2020-11-09 15:23:28,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:28,870 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:23:28,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,871 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:28,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,872 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:28,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,873 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:28,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:28,875 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:23:28,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:28,875 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 3, 3, 1] term [2020-11-09 15:23:28,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:28,876 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 3, 1] term [2020-11-09 15:23:28,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:23:29,126 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:23:29,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:23:29,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:29,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:23:29,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:23:29,127 INFO L87 Difference]: Start difference. First operand 429 states and 947 transitions. Second operand 8 states. [2020-11-09 15:23:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:29,246 INFO L93 Difference]: Finished difference Result 477 states and 1060 transitions. [2020-11-09 15:23:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:23:29,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-11-09 15:23:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:29,248 INFO L225 Difference]: With dead ends: 477 [2020-11-09 15:23:29,248 INFO L226 Difference]: Without dead ends: 370 [2020-11-09 15:23:29,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:23:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-11-09 15:23:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 322. [2020-11-09 15:23:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-11-09 15:23:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 700 transitions. [2020-11-09 15:23:29,257 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 700 transitions. Word has length 24 [2020-11-09 15:23:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:29,258 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 700 transitions. [2020-11-09 15:23:29,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:23:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 700 transitions. [2020-11-09 15:23:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-09 15:23:29,259 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:29,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:23:29,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 15:23:29,259 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:23:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1018346385, now seen corresponding path program 1 times [2020-11-09 15:23:29,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:29,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400948797] [2020-11-09 15:23:29,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:23:29,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 15:23:29,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400948797] [2020-11-09 15:23:29,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:23:29,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:23:29,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409265845] [2020-11-09 15:23:29,355 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:23:29,360 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:23:29,397 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 193 transitions. [2020-11-09 15:23:29,397 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:23:29,423 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:23:29,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,452 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:29,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,453 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:29,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,454 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:29,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,472 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:29,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,473 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:29,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,474 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:29,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,492 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:29,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,493 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:29,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,494 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:29,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,518 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:23:29,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,519 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:23:29,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,520 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:23:29,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:23:29,536 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [86312#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 15:23:29,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:23:29,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:23:29,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:23:29,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:23:29,537 INFO L87 Difference]: Start difference. First operand 322 states and 700 transitions. Second operand 8 states. [2020-11-09 15:23:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:23:29,626 INFO L93 Difference]: Finished difference Result 293 states and 643 transitions. [2020-11-09 15:23:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:23:29,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-11-09 15:23:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:23:29,627 INFO L225 Difference]: With dead ends: 293 [2020-11-09 15:23:29,627 INFO L226 Difference]: Without dead ends: 65 [2020-11-09 15:23:29,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:23:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-09 15:23:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-09 15:23:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-09 15:23:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-11-09 15:23:29,630 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 24 [2020-11-09 15:23:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:23:29,631 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-11-09 15:23:29,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:23:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-11-09 15:23:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 15:23:29,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:23:29,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:23:29,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 15:23:29,632 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:23:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:23:29,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1677699125, now seen corresponding path program 1 times [2020-11-09 15:23:29,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:23:29,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877270763] [2020-11-09 15:23:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:23:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:23:29,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:23:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:23:29,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:23:29,825 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:23:29,826 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:23:29,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 15:23:30,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:23:30 BasicIcfg [2020-11-09 15:23:30,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:23:30,008 INFO L168 Benchmark]: Toolchain (without parser) took 28790.88 ms. Allocated memory was 153.1 MB in the beginning and 634.4 MB in the end (delta: 481.3 MB). Free memory was 127.5 MB in the beginning and 222.3 MB in the end (delta: -94.8 MB). Peak memory consumption was 388.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:23:30,009 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 153.1 MB. Free memory was 126.7 MB in the beginning and 126.6 MB in the end (delta: 109.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:23:30,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.17 ms. Allocated memory is still 153.1 MB. Free memory was 126.8 MB in the beginning and 121.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 8.0 GB. [2020-11-09 15:23:30,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.76 ms. Allocated memory is still 153.1 MB. Free memory was 121.9 MB in the beginning and 119.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:23:30,010 INFO L168 Benchmark]: Boogie Preprocessor took 54.03 ms. Allocated memory is still 153.1 MB. Free memory was 119.2 MB in the beginning and 116.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:23:30,011 INFO L168 Benchmark]: RCFGBuilder took 2538.84 ms. Allocated memory was 153.1 MB in the beginning and 191.9 MB in the end (delta: 38.8 MB). Free memory was 116.6 MB in the beginning and 111.6 MB in the end (delta: 5.1 MB). Peak memory consumption was 74.8 MB. Max. memory is 8.0 GB. [2020-11-09 15:23:30,016 INFO L168 Benchmark]: TraceAbstraction took 25286.75 ms. Allocated memory was 191.9 MB in the beginning and 634.4 MB in the end (delta: 442.5 MB). Free memory was 111.0 MB in the beginning and 222.3 MB in the end (delta: -111.3 MB). Peak memory consumption was 331.7 MB. Max. memory is 8.0 GB. [2020-11-09 15:23:30,020 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.24 ms. Allocated memory is still 153.1 MB. Free memory was 126.7 MB in the beginning and 126.6 MB in the end (delta: 109.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 819.17 ms. Allocated memory is still 153.1 MB. Free memory was 126.8 MB in the beginning and 121.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 72.76 ms. Allocated memory is still 153.1 MB. Free memory was 121.9 MB in the beginning and 119.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 54.03 ms. Allocated memory is still 153.1 MB. Free memory was 119.2 MB in the beginning and 116.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2538.84 ms. Allocated memory was 153.1 MB in the beginning and 191.9 MB in the end (delta: 38.8 MB). Free memory was 116.6 MB in the beginning and 111.6 MB in the end (delta: 5.1 MB). Peak memory consumption was 74.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 25286.75 ms. Allocated memory was 191.9 MB in the beginning and 634.4 MB in the end (delta: 442.5 MB). Free memory was 111.0 MB in the beginning and 222.3 MB in the end (delta: -111.3 MB). Peak memory consumption was 331.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1512 VarBasedMoverChecksPositive, 28 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 148 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.7s, 130 PlacesBefore, 47 PlacesAfterwards, 120 TransitionsBefore, 35 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 8162 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1269; [L845] FCALL, FORK 0 pthread_create(&t1269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1270; [L847] FCALL, FORK 0 pthread_create(&t1270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1271; [L849] FCALL, FORK 0 pthread_create(&t1271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1272; [L851] FCALL, FORK 0 pthread_create(&t1272, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L780] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix047_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.0s, HoareTripleCheckerStatistics: 639 SDtfs, 910 SDslu, 1478 SDs, 0 SdLazy, 432 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 616 GetRequests, 457 SyntacticMatches, 62 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4122occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 915 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 30390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...