/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/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:26:25,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:26:25,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:26:25,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:26:25,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:26:25,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:26:25,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:26:25,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:26:25,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:26:25,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:26:25,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:26:25,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:26:25,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:26:25,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:26:25,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:26:25,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:26:25,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:26:25,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:26:25,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:26:25,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:26:25,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:26:25,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:26:25,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:26:25,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:26:25,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:26:25,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:26:25,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:26:25,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:26:25,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:26:25,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:26:25,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:26:25,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:26:25,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:26:25,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:26:25,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:26:25,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:26:25,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:26:25,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:26:25,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:26:25,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:26:25,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:26:25,456 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:26:25,516 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:26:25,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:26:25,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:26:25,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:26:25,521 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:26:25,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:26:25,522 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:26:25,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:26:25,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:26:25,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:26:25,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:26:25,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:26:25,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:26:25,525 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:26:25,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:26:25,525 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:26:25,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:26:25,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:26:25,526 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:26:25,526 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:26:25,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:26:25,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:26:25,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:26:25,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:26:25,528 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:26:25,528 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:26:25,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:26:25,528 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:26:25,529 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:26:25,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:26:25,529 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:26:25,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:26:26,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:26:26,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:26:26,041 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:26:26,042 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:26:26,043 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2020-11-09 15:26:26,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1c8e8dd/44a7e19181c541ca94d60cec058e4893/FLAG23bcb003e [2020-11-09 15:26:26,929 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:26:26,930 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2020-11-09 15:26:26,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1c8e8dd/44a7e19181c541ca94d60cec058e4893/FLAG23bcb003e [2020-11-09 15:26:27,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1c8e8dd/44a7e19181c541ca94d60cec058e4893 [2020-11-09 15:26:27,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:26:27,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:26:27,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:26:27,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:26:27,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:26:27,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:26:27" (1/1) ... [2020-11-09 15:26:27,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c3c476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:27, skipping insertion in model container [2020-11-09 15:26:27,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:26:27" (1/1) ... [2020-11-09 15:26:27,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:26:27,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:26:28,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:26:28,022 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:26:28,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:26:28,289 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:26:28,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:28 WrapperNode [2020-11-09 15:26:28,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:26:28,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:26:28,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:26:28,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:26:28,306 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:26:28" (1/1) ... [2020-11-09 15:26:28,365 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:26:28" (1/1) ... [2020-11-09 15:26:28,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:26:28,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:26:28,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:26:28,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:26:28,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:28" (1/1) ... [2020-11-09 15:26:28,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:28" (1/1) ... [2020-11-09 15:26:28,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:28" (1/1) ... [2020-11-09 15:26:28,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:28" (1/1) ... [2020-11-09 15:26:28,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:28" (1/1) ... [2020-11-09 15:26:28,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:28" (1/1) ... [2020-11-09 15:26:28,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:28" (1/1) ... [2020-11-09 15:26:28,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:26:28,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:26:28,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:26:28,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:26:28,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:28" (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:26:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:26:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:26:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:26:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:26:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:26:28,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:26:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:26:28,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:26:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 15:26:28,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 15:26:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-09 15:26:28,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-09 15:26:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:26:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:26:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:26:28,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:26:28,676 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:26:31,524 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:26:31,524 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:26:31,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:31 BoogieIcfgContainer [2020-11-09 15:26:31,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:26:31,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:26:31,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:26:31,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:26:31,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:26:27" (1/3) ... [2020-11-09 15:26:31,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66400a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:26:31, skipping insertion in model container [2020-11-09 15:26:31,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:28" (2/3) ... [2020-11-09 15:26:31,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66400a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:26:31, skipping insertion in model container [2020-11-09 15:26:31,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:31" (3/3) ... [2020-11-09 15:26:31,537 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2020-11-09 15:26:31,557 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:26:31,557 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:26:31,562 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:26:31,564 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:26:31,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,611 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,611 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,611 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,612 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,613 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,614 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,614 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,614 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,616 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,616 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,617 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,617 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,622 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,622 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,623 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,623 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,623 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,624 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,626 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,627 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,634 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,636 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,637 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,644 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,645 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,647 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,647 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,650 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,650 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:31,653 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:26:31,665 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 15:26:31,692 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:26:31,692 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:26:31,693 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:26:31,693 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:26:31,693 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:26:31,693 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:26:31,693 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:26:31,693 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:26:31,708 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:26:31,709 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-09 15:26:31,713 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-09 15:26:31,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-11-09 15:26:31,770 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-11-09 15:26:31,770 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:26:31,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-11-09 15:26:31,780 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-11-09 15:26:33,128 WARN L194 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 15:26:33,260 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 15:26:33,848 WARN L194 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-09 15:26:33,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:26:33,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:34,333 WARN L194 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-09 15:26:34,585 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 15:26:34,702 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-11-09 15:26:34,829 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-11-09 15:26:37,725 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-09 15:26:37,955 WARN L194 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-09 15:26:39,545 WARN L194 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-11-09 15:26:39,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 15:26:39,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:39,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 15:26:39,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:40,871 WARN L194 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 148 DAG size of output: 110 [2020-11-09 15:26:43,354 WARN L194 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 315 DAG size of output: 270 [2020-11-09 15:26:43,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:26:43,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:26:43,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:43,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:43,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:26:43,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:26:43,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:26:43,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:43,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:43,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:26:43,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:26:43,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:26:43,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:43,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:43,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-11-09 15:26:43,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:43,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:43,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:26:43,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:43,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:26:43,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:43,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:26:43,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:43,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:43,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:45,668 WARN L194 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 356 DAG size of output: 232 [2020-11-09 15:26:46,948 WARN L194 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-11-09 15:26:46,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 15:26:46,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:46,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 15:26:46,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:48,212 WARN L194 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 148 DAG size of output: 109 [2020-11-09 15:26:51,063 WARN L194 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 315 DAG size of output: 271 [2020-11-09 15:26:51,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:51,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:26:51,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:51,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:51,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:51,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:26:51,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:26:51,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:51,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:26:51,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:51,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:51,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:51,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:51,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:51,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:51,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:26:51,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:55,144 WARN L194 SmtUtils]: Spent 3.99 s on a formula simplification. DAG size of input: 358 DAG size of output: 249 [2020-11-09 15:26:55,324 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:26:55,483 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:26:55,646 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:26:55,806 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:26:56,583 WARN L194 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-09 15:26:56,870 WARN L194 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 15:26:57,458 WARN L194 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-09 15:26:57,761 WARN L194 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 15:26:59,332 WARN L194 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 247 DAG size of output: 207 [2020-11-09 15:26:59,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 15:26:59,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:59,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 15:26:59,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:00,522 WARN L194 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 164 DAG size of output: 135 [2020-11-09 15:27:05,588 WARN L194 SmtUtils]: Spent 5.06 s on a formula simplification. DAG size of input: 331 DAG size of output: 287 [2020-11-09 15:27:05,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:27:05,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:05,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:05,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:05,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:27:05,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:05,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:05,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:05,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:27:05,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:05,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:05,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:05,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:27:05,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:27:05,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:27:05,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:05,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:27:05,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:27:05,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:05,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:05,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:27:05,648 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-11-09 15:27:05,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 1] term [2020-11-09 15:27:05,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:05,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 1] term [2020-11-09 15:27:05,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:27:05,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:05,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:05,664 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-11-09 15:27:05,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:13,969 WARN L194 SmtUtils]: Spent 8.29 s on a formula simplification. DAG size of input: 392 DAG size of output: 295 [2020-11-09 15:27:14,055 INFO L131 LiptonReduction]: Checked pairs total: 7247 [2020-11-09 15:27:14,055 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-11-09 15:27:14,064 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-11-09 15:27:14,258 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-11-09 15:27:14,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-11-09 15:27:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 15:27:14,270 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:14,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:14,272 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:27:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash 477405012, now seen corresponding path program 1 times [2020-11-09 15:27:14,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:14,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673314315] [2020-11-09 15:27:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:14,714 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:27:14,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673314315] [2020-11-09 15:27:14,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:14,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:27:14,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1643054326] [2020-11-09 15:27:14,720 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:14,726 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:14,749 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 15:27:14,749 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:14,756 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:14,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:14,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:14,781 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-11-09 15:27:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:14,923 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-11-09 15:27:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:14,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 15:27:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:14,978 INFO L225 Difference]: With dead ends: 2202 [2020-11-09 15:27:14,978 INFO L226 Difference]: Without dead ends: 1802 [2020-11-09 15:27:14,980 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:27:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-11-09 15:27:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-11-09 15:27:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-11-09 15:27:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-11-09 15:27:15,177 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-11-09 15:27:15,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:15,178 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-11-09 15:27:15,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:15,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-11-09 15:27:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 15:27:15,182 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:15,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:15,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:27:15,182 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:27:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash -775206985, now seen corresponding path program 1 times [2020-11-09 15:27:15,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:15,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692038965] [2020-11-09 15:27:15,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:15,288 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:27:15,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692038965] [2020-11-09 15:27:15,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:15,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:27:15,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1222370942] [2020-11-09 15:27:15,290 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:15,291 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:15,294 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-11-09 15:27:15,294 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:15,294 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:15,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:15,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:15,297 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-11-09 15:27:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:15,330 INFO L93 Difference]: Finished difference Result 1752 states and 6554 transitions. [2020-11-09 15:27:15,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:15,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 15:27:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:15,351 INFO L225 Difference]: With dead ends: 1752 [2020-11-09 15:27:15,351 INFO L226 Difference]: Without dead ends: 1752 [2020-11-09 15:27:15,352 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:27:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2020-11-09 15:27:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2020-11-09 15:27:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2020-11-09 15:27:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 6554 transitions. [2020-11-09 15:27:15,481 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 6554 transitions. Word has length 11 [2020-11-09 15:27:15,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:15,482 INFO L481 AbstractCegarLoop]: Abstraction has 1752 states and 6554 transitions. [2020-11-09 15:27:15,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 6554 transitions. [2020-11-09 15:27:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 15:27:15,490 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:15,490 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:15,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:27:15,491 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:27:15,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:15,492 INFO L82 PathProgramCache]: Analyzing trace with hash 382188627, now seen corresponding path program 1 times [2020-11-09 15:27:15,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:15,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574237989] [2020-11-09 15:27:15,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:15,644 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:27:15,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574237989] [2020-11-09 15:27:15,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:15,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:27:15,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1252011429] [2020-11-09 15:27:15,645 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:15,647 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:15,650 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-11-09 15:27:15,651 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:15,765 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:15,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:15,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:15,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:15,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:15,767 INFO L87 Difference]: Start difference. First operand 1752 states and 6554 transitions. Second operand 3 states. [2020-11-09 15:27:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:15,801 INFO L93 Difference]: Finished difference Result 1722 states and 6420 transitions. [2020-11-09 15:27:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:15,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-09 15:27:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:15,822 INFO L225 Difference]: With dead ends: 1722 [2020-11-09 15:27:15,823 INFO L226 Difference]: Without dead ends: 1722 [2020-11-09 15:27:15,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2020-11-09 15:27:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2020-11-09 15:27:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2020-11-09 15:27:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 6420 transitions. [2020-11-09 15:27:15,904 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 6420 transitions. Word has length 12 [2020-11-09 15:27:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:15,904 INFO L481 AbstractCegarLoop]: Abstraction has 1722 states and 6420 transitions. [2020-11-09 15:27:15,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 6420 transitions. [2020-11-09 15:27:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:27:15,907 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:15,907 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:15,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:27:15,907 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:27:15,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:15,908 INFO L82 PathProgramCache]: Analyzing trace with hash -709915685, now seen corresponding path program 1 times [2020-11-09 15:27:15,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:15,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887626090] [2020-11-09 15:27:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:15,977 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:27:15,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887626090] [2020-11-09 15:27:15,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:15,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:27:15,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [816021408] [2020-11-09 15:27:15,978 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:15,981 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:15,985 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 37 transitions. [2020-11-09 15:27:15,985 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:15,987 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:15,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:15,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:15,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:15,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:15,989 INFO L87 Difference]: Start difference. First operand 1722 states and 6420 transitions. Second operand 3 states. [2020-11-09 15:27:16,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:16,038 INFO L93 Difference]: Finished difference Result 2386 states and 8562 transitions. [2020-11-09 15:27:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:16,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-09 15:27:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:16,059 INFO L225 Difference]: With dead ends: 2386 [2020-11-09 15:27:16,059 INFO L226 Difference]: Without dead ends: 1842 [2020-11-09 15:27:16,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:27:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2020-11-09 15:27:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1682. [2020-11-09 15:27:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2020-11-09 15:27:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 5986 transitions. [2020-11-09 15:27:16,138 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 5986 transitions. Word has length 13 [2020-11-09 15:27:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:16,138 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 5986 transitions. [2020-11-09 15:27:16,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:16,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 5986 transitions. [2020-11-09 15:27:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:27:16,141 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:16,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:16,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:27:16,149 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:27:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1037055385, now seen corresponding path program 1 times [2020-11-09 15:27:16,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:16,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965003088] [2020-11-09 15:27:16,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:16,256 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:27:16,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965003088] [2020-11-09 15:27:16,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:16,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:27:16,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [687052361] [2020-11-09 15:27:16,257 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:16,259 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:16,263 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 47 transitions. [2020-11-09 15:27:16,264 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:16,271 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:27:16,271 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,272 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:16,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,387 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:27:16,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,388 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:16,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,480 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:27:16,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,481 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:16,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,587 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:16,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:16,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:16,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:16,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:16,589 INFO L87 Difference]: Start difference. First operand 1682 states and 5986 transitions. Second operand 3 states. [2020-11-09 15:27:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:16,646 INFO L93 Difference]: Finished difference Result 1668 states and 5924 transitions. [2020-11-09 15:27:16,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:16,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-09 15:27:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:16,665 INFO L225 Difference]: With dead ends: 1668 [2020-11-09 15:27:16,666 INFO L226 Difference]: Without dead ends: 1668 [2020-11-09 15:27:16,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:27:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2020-11-09 15:27:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2020-11-09 15:27:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2020-11-09 15:27:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 5924 transitions. [2020-11-09 15:27:16,740 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 5924 transitions. Word has length 13 [2020-11-09 15:27:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:16,740 INFO L481 AbstractCegarLoop]: Abstraction has 1668 states and 5924 transitions. [2020-11-09 15:27:16,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 5924 transitions. [2020-11-09 15:27:16,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:27:16,743 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:16,743 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:16,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:27:16,744 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:27:16,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:16,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2127906781, now seen corresponding path program 1 times [2020-11-09 15:27:16,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:16,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333174557] [2020-11-09 15:27:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:16,987 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:27:16,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333174557] [2020-11-09 15:27:16,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:16,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:16,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [197945853] [2020-11-09 15:27:16,989 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:16,991 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:16,999 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 67 transitions. [2020-11-09 15:27:17,000 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:17,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:27:17,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,008 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:17,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,070 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:27:17,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,071 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:17,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,136 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:27:17,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,137 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:17,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,443 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:17,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:27:17,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:17,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:27:17,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:17,445 INFO L87 Difference]: Start difference. First operand 1668 states and 5924 transitions. Second operand 5 states. [2020-11-09 15:27:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:17,661 INFO L93 Difference]: Finished difference Result 1640 states and 5800 transitions. [2020-11-09 15:27:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:17,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 15:27:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:17,679 INFO L225 Difference]: With dead ends: 1640 [2020-11-09 15:27:17,679 INFO L226 Difference]: Without dead ends: 1640 [2020-11-09 15:27:17,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:27:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2020-11-09 15:27:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2020-11-09 15:27:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2020-11-09 15:27:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 5800 transitions. [2020-11-09 15:27:17,744 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 5800 transitions. Word has length 14 [2020-11-09 15:27:17,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:17,744 INFO L481 AbstractCegarLoop]: Abstraction has 1640 states and 5800 transitions. [2020-11-09 15:27:17,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:27:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 5800 transitions. [2020-11-09 15:27:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:27:17,748 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:17,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:17,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:27:17,749 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:27:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2083948285, now seen corresponding path program 1 times [2020-11-09 15:27:17,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:17,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369246194] [2020-11-09 15:27:17,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:17,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:27:17,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369246194] [2020-11-09 15:27:17,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:17,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:27:17,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1294740656] [2020-11-09 15:27:17,858 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:17,860 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:17,866 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 50 transitions. [2020-11-09 15:27:17,866 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:18,134 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:18,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:27:18,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:18,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:27:18,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:18,136 INFO L87 Difference]: Start difference. First operand 1640 states and 5800 transitions. Second operand 4 states. [2020-11-09 15:27:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:18,239 INFO L93 Difference]: Finished difference Result 1656 states and 5852 transitions. [2020-11-09 15:27:18,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:18,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-09 15:27:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:18,259 INFO L225 Difference]: With dead ends: 1656 [2020-11-09 15:27:18,259 INFO L226 Difference]: Without dead ends: 1656 [2020-11-09 15:27:18,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2020-11-09 15:27:18,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2020-11-09 15:27:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2020-11-09 15:27:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 5852 transitions. [2020-11-09 15:27:18,335 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 5852 transitions. Word has length 14 [2020-11-09 15:27:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:18,335 INFO L481 AbstractCegarLoop]: Abstraction has 1656 states and 5852 transitions. [2020-11-09 15:27:18,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:27:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 5852 transitions. [2020-11-09 15:27:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:27:18,338 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:18,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:18,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:27:18,339 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:27:18,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:18,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2085272605, now seen corresponding path program 2 times [2020-11-09 15:27:18,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:18,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044313287] [2020-11-09 15:27:18,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:18,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044313287] [2020-11-09 15:27:18,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:18,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:18,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [172393276] [2020-11-09 15:27:18,491 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:18,495 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:18,501 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 60 transitions. [2020-11-09 15:27:18,501 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:18,528 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:27:18,528 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,529 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:18,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,753 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:18,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:27:18,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:18,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:27:18,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:18,755 INFO L87 Difference]: Start difference. First operand 1656 states and 5852 transitions. Second operand 5 states. [2020-11-09 15:27:18,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:18,893 INFO L93 Difference]: Finished difference Result 1642 states and 5790 transitions. [2020-11-09 15:27:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:18,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 15:27:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:18,931 INFO L225 Difference]: With dead ends: 1642 [2020-11-09 15:27:18,932 INFO L226 Difference]: Without dead ends: 1642 [2020-11-09 15:27:18,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:18,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2020-11-09 15:27:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1626. [2020-11-09 15:27:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-11-09 15:27:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 5738 transitions. [2020-11-09 15:27:18,999 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 5738 transitions. Word has length 14 [2020-11-09 15:27:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:19,000 INFO L481 AbstractCegarLoop]: Abstraction has 1626 states and 5738 transitions. [2020-11-09 15:27:19,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:27:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 5738 transitions. [2020-11-09 15:27:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:27:19,003 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:19,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:19,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:27:19,004 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:27:19,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:19,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1540603193, now seen corresponding path program 1 times [2020-11-09 15:27:19,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:19,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58904097] [2020-11-09 15:27:19,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:19,143 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:27:19,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58904097] [2020-11-09 15:27:19,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:19,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:19,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910178015] [2020-11-09 15:27:19,145 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:19,148 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:19,156 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 70 transitions. [2020-11-09 15:27:19,156 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:19,585 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:19,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:27:19,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:19,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:27:19,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:19,587 INFO L87 Difference]: Start difference. First operand 1626 states and 5738 transitions. Second operand 5 states. [2020-11-09 15:27:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:19,765 INFO L93 Difference]: Finished difference Result 1798 states and 6304 transitions. [2020-11-09 15:27:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:27:19,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 15:27:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:19,779 INFO L225 Difference]: With dead ends: 1798 [2020-11-09 15:27:19,779 INFO L226 Difference]: Without dead ends: 1798 [2020-11-09 15:27:19,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 3 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:27:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2020-11-09 15:27:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1706. [2020-11-09 15:27:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2020-11-09 15:27:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 5982 transitions. [2020-11-09 15:27:19,854 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 5982 transitions. Word has length 15 [2020-11-09 15:27:19,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:19,854 INFO L481 AbstractCegarLoop]: Abstraction has 1706 states and 5982 transitions. [2020-11-09 15:27:19,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:27:19,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 5982 transitions. [2020-11-09 15:27:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:27:19,858 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:19,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:19,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:27:19,858 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:27:19,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:19,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1541927513, now seen corresponding path program 2 times [2020-11-09 15:27:19,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:19,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084668082] [2020-11-09 15:27:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:20,101 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:27:20,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084668082] [2020-11-09 15:27:20,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:20,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:27:20,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2104085962] [2020-11-09 15:27:20,102 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:20,104 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:20,114 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 92 transitions. [2020-11-09 15:27:20,114 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:20,296 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:27:20,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:20,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,657 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [52353#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (not (= 2 ~z~0)))] [2020-11-09 15:27:20,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:27:20,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:20,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:27:20,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:27:20,658 INFO L87 Difference]: Start difference. First operand 1706 states and 5982 transitions. Second operand 7 states. [2020-11-09 15:27:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:20,864 INFO L93 Difference]: Finished difference Result 1926 states and 6712 transitions. [2020-11-09 15:27:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:27:20,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-09 15:27:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:20,877 INFO L225 Difference]: With dead ends: 1926 [2020-11-09 15:27:20,878 INFO L226 Difference]: Without dead ends: 1926 [2020-11-09 15:27:20,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:27:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2020-11-09 15:27:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1770. [2020-11-09 15:27:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1770 states. [2020-11-09 15:27:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 6222 transitions. [2020-11-09 15:27:20,961 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 6222 transitions. Word has length 15 [2020-11-09 15:27:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:20,965 INFO L481 AbstractCegarLoop]: Abstraction has 1770 states and 6222 transitions. [2020-11-09 15:27:20,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:27:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 6222 transitions. [2020-11-09 15:27:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:27:20,971 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:20,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:20,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 15:27:20,972 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:27:20,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash -177889786, now seen corresponding path program 1 times [2020-11-09 15:27:20,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:20,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518906205] [2020-11-09 15:27:20,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:21,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518906205] [2020-11-09 15:27:21,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:21,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:21,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1121320568] [2020-11-09 15:27:21,129 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:21,131 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:21,137 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 53 transitions. [2020-11-09 15:27:21,137 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:21,232 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:21,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,234 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:21,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,235 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:21,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,238 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:27:21,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,238 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:21,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,493 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:21,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:27:21,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:21,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:27:21,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:21,495 INFO L87 Difference]: Start difference. First operand 1770 states and 6222 transitions. Second operand 5 states. [2020-11-09 15:27:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:21,630 INFO L93 Difference]: Finished difference Result 1802 states and 6310 transitions. [2020-11-09 15:27:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:21,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 15:27:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:21,642 INFO L225 Difference]: With dead ends: 1802 [2020-11-09 15:27:21,643 INFO L226 Difference]: Without dead ends: 1802 [2020-11-09 15:27:21,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-11-09 15:27:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-11-09 15:27:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-11-09 15:27:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6310 transitions. [2020-11-09 15:27:21,725 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6310 transitions. Word has length 15 [2020-11-09 15:27:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:21,726 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6310 transitions. [2020-11-09 15:27:21,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:27:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6310 transitions. [2020-11-09 15:27:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:27:21,731 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:21,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:21,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 15:27:21,731 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:27:21,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:21,732 INFO L82 PathProgramCache]: Analyzing trace with hash -218942063, now seen corresponding path program 3 times [2020-11-09 15:27:21,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:21,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741724398] [2020-11-09 15:27:21,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:21,882 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:27:21,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741724398] [2020-11-09 15:27:21,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:21,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:27:21,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1962844825] [2020-11-09 15:27:21,883 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:21,885 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:21,892 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 63 transitions. [2020-11-09 15:27:21,892 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:21,933 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 15:27:21,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,935 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:27:21,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:22,075 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:22,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:27:22,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:22,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:27:22,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:27:22,077 INFO L87 Difference]: Start difference. First operand 1802 states and 6310 transitions. Second operand 6 states. [2020-11-09 15:27:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:22,234 INFO L93 Difference]: Finished difference Result 1870 states and 6562 transitions. [2020-11-09 15:27:22,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:27:22,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-09 15:27:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:22,246 INFO L225 Difference]: With dead ends: 1870 [2020-11-09 15:27:22,246 INFO L226 Difference]: Without dead ends: 1870 [2020-11-09 15:27:22,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:27:22,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2020-11-09 15:27:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1742. [2020-11-09 15:27:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2020-11-09 15:27:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 6082 transitions. [2020-11-09 15:27:22,341 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 6082 transitions. Word has length 15 [2020-11-09 15:27:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:22,342 INFO L481 AbstractCegarLoop]: Abstraction has 1742 states and 6082 transitions. [2020-11-09 15:27:22,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:27:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 6082 transitions. [2020-11-09 15:27:22,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:27:22,346 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:22,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:22,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 15:27:22,346 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:27:22,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:22,347 INFO L82 PathProgramCache]: Analyzing trace with hash -218943706, now seen corresponding path program 2 times [2020-11-09 15:27:22,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:22,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055020008] [2020-11-09 15:27:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:22,513 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:27:22,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055020008] [2020-11-09 15:27:22,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:22,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:27:22,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [705607488] [2020-11-09 15:27:22,518 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:22,521 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:22,528 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 63 transitions. [2020-11-09 15:27:22,529 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:22,561 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:27:22,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:22,562 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:22,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:22,566 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:22,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:22,568 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:22,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:22,569 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:22,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:22,631 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:27:22,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:22,632 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:22,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:22,784 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:22,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:27:22,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:22,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:27:22,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:27:22,785 INFO L87 Difference]: Start difference. First operand 1742 states and 6082 transitions. Second operand 6 states. [2020-11-09 15:27:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:22,951 INFO L93 Difference]: Finished difference Result 1714 states and 5972 transitions. [2020-11-09 15:27:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:22,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-09 15:27:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:22,965 INFO L225 Difference]: With dead ends: 1714 [2020-11-09 15:27:22,965 INFO L226 Difference]: Without dead ends: 1714 [2020-11-09 15:27:22,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:27:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2020-11-09 15:27:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1666. [2020-11-09 15:27:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1666 states. [2020-11-09 15:27:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 5832 transitions. [2020-11-09 15:27:23,027 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 5832 transitions. Word has length 15 [2020-11-09 15:27:23,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:23,028 INFO L481 AbstractCegarLoop]: Abstraction has 1666 states and 5832 transitions. [2020-11-09 15:27:23,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:27:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 5832 transitions. [2020-11-09 15:27:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:27:23,032 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:23,032 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:27:23,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 15:27:23,033 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:27:23,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:23,033 INFO L82 PathProgramCache]: Analyzing trace with hash -591786302, now seen corresponding path program 1 times [2020-11-09 15:27:23,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:23,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021099543] [2020-11-09 15:27:23,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:23,165 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:27:23,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021099543] [2020-11-09 15:27:23,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:23,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:23,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1833170908] [2020-11-09 15:27:23,166 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:23,168 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:23,179 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 107 transitions. [2020-11-09 15:27:23,179 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:23,240 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:23,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,241 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:23,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,242 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:23,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,359 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:23,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,361 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:23,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,362 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:23,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:23,474 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:23,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,476 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:23,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,477 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:23,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:23,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:23,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:23,548 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:23,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,550 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:23,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,551 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:23,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,656 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:23,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:23,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:23,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:23,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:23,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:23,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:23,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:23,848 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:23,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,850 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:23,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,851 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:23,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:23,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:23,917 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:23,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,919 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:23,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,920 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:23,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:23,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:24,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:24,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:24,116 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [73649#(not (= 4 ~__unbuffered_cnt~0))] [2020-11-09 15:27:24,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:27:24,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:24,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:27:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:24,117 INFO L87 Difference]: Start difference. First operand 1666 states and 5832 transitions. Second operand 5 states. [2020-11-09 15:27:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:24,260 INFO L93 Difference]: Finished difference Result 1319 states and 4111 transitions. [2020-11-09 15:27:24,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:27:24,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-09 15:27:24,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:24,266 INFO L225 Difference]: With dead ends: 1319 [2020-11-09 15:27:24,266 INFO L226 Difference]: Without dead ends: 887 [2020-11-09 15:27:24,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:27:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-11-09 15:27:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 887. [2020-11-09 15:27:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2020-11-09 15:27:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 2527 transitions. [2020-11-09 15:27:24,296 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 2527 transitions. Word has length 16 [2020-11-09 15:27:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:24,296 INFO L481 AbstractCegarLoop]: Abstraction has 887 states and 2527 transitions. [2020-11-09 15:27:24,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:27:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 2527 transitions. [2020-11-09 15:27:24,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 15:27:24,299 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:24,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:24,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 15:27:24,299 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:27:24,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:24,300 INFO L82 PathProgramCache]: Analyzing trace with hash -232445824, now seen corresponding path program 1 times [2020-11-09 15:27:24,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:24,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959276434] [2020-11-09 15:27:24,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:24,363 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:27:24,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959276434] [2020-11-09 15:27:24,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:24,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:27:24,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2086251669] [2020-11-09 15:27:24,364 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:24,367 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:24,381 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 130 transitions. [2020-11-09 15:27:24,381 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:24,432 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:24,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:24,434 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:24,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:24,435 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:24,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:24,469 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:24,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:24,470 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:24,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:24,471 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:24,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:24,521 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:24,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:24,522 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:24,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:24,523 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:24,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:24,712 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:24,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:24,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:24,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:24,714 INFO L87 Difference]: Start difference. First operand 887 states and 2527 transitions. Second operand 3 states. [2020-11-09 15:27:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:24,737 INFO L93 Difference]: Finished difference Result 1249 states and 3426 transitions. [2020-11-09 15:27:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:24,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-11-09 15:27:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:24,744 INFO L225 Difference]: With dead ends: 1249 [2020-11-09 15:27:24,744 INFO L226 Difference]: Without dead ends: 897 [2020-11-09 15:27:24,746 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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:27:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2020-11-09 15:27:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 875. [2020-11-09 15:27:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2020-11-09 15:27:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 2355 transitions. [2020-11-09 15:27:24,784 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 2355 transitions. Word has length 19 [2020-11-09 15:27:24,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:24,785 INFO L481 AbstractCegarLoop]: Abstraction has 875 states and 2355 transitions. [2020-11-09 15:27:24,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 2355 transitions. [2020-11-09 15:27:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 15:27:24,787 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:24,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:24,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 15:27:24,788 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:27:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:24,788 INFO L82 PathProgramCache]: Analyzing trace with hash 106051531, now seen corresponding path program 1 times [2020-11-09 15:27:24,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:24,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583702792] [2020-11-09 15:27:24,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:24,953 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:27:24,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583702792] [2020-11-09 15:27:24,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:24,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:27:24,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [10150936] [2020-11-09 15:27:24,954 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:24,961 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:24,976 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 102 transitions. [2020-11-09 15:27:24,976 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:24,989 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:24,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:24,990 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:24,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:24,992 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:24,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,066 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:25,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,068 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,069 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:25,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,157 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,158 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,158 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,159 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:25,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:25,272 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [79755#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 15:27:25,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:27:25,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:25,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:27:25,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:27:25,273 INFO L87 Difference]: Start difference. First operand 875 states and 2355 transitions. Second operand 7 states. [2020-11-09 15:27:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:25,390 INFO L93 Difference]: Finished difference Result 770 states and 2027 transitions. [2020-11-09 15:27:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:27:25,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-11-09 15:27:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:25,394 INFO L225 Difference]: With dead ends: 770 [2020-11-09 15:27:25,395 INFO L226 Difference]: Without dead ends: 618 [2020-11-09 15:27:25,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:27:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-11-09 15:27:25,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 598. [2020-11-09 15:27:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2020-11-09 15:27:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1554 transitions. [2020-11-09 15:27:25,411 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1554 transitions. Word has length 19 [2020-11-09 15:27:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:25,412 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 1554 transitions. [2020-11-09 15:27:25,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:27:25,412 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1554 transitions. [2020-11-09 15:27:25,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 15:27:25,414 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:25,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:25,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 15:27:25,414 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:27:25,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:25,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1372551299, now seen corresponding path program 1 times [2020-11-09 15:27:25,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:25,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324107913] [2020-11-09 15:27:25,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:25,473 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:27:25,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324107913] [2020-11-09 15:27:25,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:25,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:25,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389579659] [2020-11-09 15:27:25,474 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:25,478 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:25,534 INFO L252 McrAutomatonBuilder]: Finished intersection with 179 states and 404 transitions. [2020-11-09 15:27:25,534 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:25,549 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:25,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,550 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,551 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:25,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,591 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:25,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,592 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,593 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:25,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,642 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:25,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,643 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,644 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:25,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,750 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:25,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,751 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,752 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:25,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,784 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:25,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,785 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,786 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:25,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,847 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,848 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,849 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:25,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,889 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,890 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,891 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:25,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,932 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,933 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:25,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:25,934 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:25,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:26,278 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:26,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:27:26,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:26,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:27:26,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:26,281 INFO L87 Difference]: Start difference. First operand 598 states and 1554 transitions. Second operand 4 states. [2020-11-09 15:27:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:26,314 INFO L93 Difference]: Finished difference Result 803 states and 2028 transitions. [2020-11-09 15:27:26,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:26,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-11-09 15:27:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:26,318 INFO L225 Difference]: With dead ends: 803 [2020-11-09 15:27:26,318 INFO L226 Difference]: Without dead ends: 471 [2020-11-09 15:27:26,319 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 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:27:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-11-09 15:27:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 468. [2020-11-09 15:27:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-11-09 15:27:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1105 transitions. [2020-11-09 15:27:26,331 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1105 transitions. Word has length 22 [2020-11-09 15:27:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:26,331 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 1105 transitions. [2020-11-09 15:27:26,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:27:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1105 transitions. [2020-11-09 15:27:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 15:27:26,335 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:26,335 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:26,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 15:27:26,335 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:26,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1722088816, now seen corresponding path program 1 times [2020-11-09 15:27:26,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:26,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798362702] [2020-11-09 15:27:26,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:26,601 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:27:26,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798362702] [2020-11-09 15:27:26,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:26,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:27:26,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [219694743] [2020-11-09 15:27:26,606 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:26,610 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:26,695 INFO L252 McrAutomatonBuilder]: Finished intersection with 209 states and 484 transitions. [2020-11-09 15:27:26,695 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:26,701 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:26,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:26,703 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:26,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:26,708 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:26,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:26,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:26,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:26,711 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:26,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:27,002 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 16 [2020-11-09 15:27:27,163 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:27,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:27,165 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:27,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:27,166 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:27,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:27,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:27,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:27,171 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:27,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:27,934 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [83477#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (not (= 2 ~z~0))), 83476#(and (= ~z$w_buff1~0 0) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (= ~z$w_buff0~0 2)), 83479#(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)), 83478#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$r_buff0_thd3~0 0) (not (= 2 ~z~0))), 83480#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0))] [2020-11-09 15:27:27,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 15:27:27,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 15:27:27,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:27:27,935 INFO L87 Difference]: Start difference. First operand 468 states and 1105 transitions. Second operand 12 states. [2020-11-09 15:27:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:28,133 INFO L93 Difference]: Finished difference Result 563 states and 1295 transitions. [2020-11-09 15:27:28,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:27:28,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 15:27:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:28,137 INFO L225 Difference]: With dead ends: 563 [2020-11-09 15:27:28,137 INFO L226 Difference]: Without dead ends: 299 [2020-11-09 15:27:28,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-11-09 15:27:28,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-11-09 15:27:28,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2020-11-09 15:27:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-11-09 15:27:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 646 transitions. [2020-11-09 15:27:28,145 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 646 transitions. Word has length 22 [2020-11-09 15:27:28,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:28,146 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 646 transitions. [2020-11-09 15:27:28,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 15:27:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 646 transitions. [2020-11-09 15:27:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 15:27:28,147 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:28,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:28,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 15:27:28,147 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:28,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:28,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2144444351, now seen corresponding path program 1 times [2020-11-09 15:27:28,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:28,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748805489] [2020-11-09 15:27:28,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:28,319 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:27:28,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748805489] [2020-11-09 15:27:28,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:28,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:27:28,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [117278719] [2020-11-09 15:27:28,320 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:28,324 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:28,368 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 126 transitions. [2020-11-09 15:27:28,368 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:28,379 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:28,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:28,380 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:28,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:28,381 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:28,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:28,545 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [84645#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 15:27:28,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:27:28,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:28,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:27:28,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:27:28,547 INFO L87 Difference]: Start difference. First operand 296 states and 646 transitions. Second operand 8 states. [2020-11-09 15:27:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:28,672 INFO L93 Difference]: Finished difference Result 276 states and 607 transitions. [2020-11-09 15:27:28,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:27:28,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-09 15:27:28,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:28,675 INFO L225 Difference]: With dead ends: 276 [2020-11-09 15:27:28,675 INFO L226 Difference]: Without dead ends: 63 [2020-11-09 15:27:28,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:27:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-09 15:27:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-09 15:27:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-09 15:27:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2020-11-09 15:27:28,678 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 22 [2020-11-09 15:27:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:28,678 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2020-11-09 15:27:28,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:27:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2020-11-09 15:27:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-09 15:27:28,679 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:28,679 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:28,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 15:27:28,679 INFO L429 AbstractCegarLoop]: === Iteration 20 === [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:27:28,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash 81887815, now seen corresponding path program 1 times [2020-11-09 15:27:28,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:28,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817191414] [2020-11-09 15:27:28,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:27:28,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:27:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:27:28,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:27:28,832 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:27:28,832 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:27:28,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-09 15:27:28,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:27:28 BasicIcfg [2020-11-09 15:27:28,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:27:28,993 INFO L168 Benchmark]: Toolchain (without parser) took 61784.69 ms. Allocated memory was 153.1 MB in the beginning and 348.1 MB in the end (delta: 195.0 MB). Free memory was 127.2 MB in the beginning and 230.1 MB in the end (delta: -102.8 MB). Peak memory consumption was 92.4 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:28,994 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 153.1 MB. Free memory is still 125.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:27:28,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1075.85 ms. Allocated memory is still 153.1 MB. Free memory was 126.6 MB in the beginning and 125.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 29.8 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:28,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 155.11 ms. Allocated memory is still 153.1 MB. Free memory was 125.3 MB in the beginning and 122.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:28,995 INFO L168 Benchmark]: Boogie Preprocessor took 99.63 ms. Allocated memory is still 153.1 MB. Free memory was 122.2 MB in the beginning and 120.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:28,996 INFO L168 Benchmark]: RCFGBuilder took 2975.18 ms. Allocated memory was 153.1 MB in the beginning and 190.8 MB in the end (delta: 37.7 MB). Free memory was 120.2 MB in the beginning and 108.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 77.9 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:28,996 INFO L168 Benchmark]: TraceAbstraction took 57463.07 ms. Allocated memory was 190.8 MB in the beginning and 348.1 MB in the end (delta: 157.3 MB). Free memory was 108.3 MB in the beginning and 230.1 MB in the end (delta: -121.7 MB). Peak memory consumption was 35.0 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:28,999 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.82 ms. Allocated memory is still 153.1 MB. Free memory is still 125.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1075.85 ms. Allocated memory is still 153.1 MB. Free memory was 126.6 MB in the beginning and 125.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 29.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 155.11 ms. Allocated memory is still 153.1 MB. Free memory was 125.3 MB in the beginning and 122.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 99.63 ms. Allocated memory is still 153.1 MB. Free memory was 122.2 MB in the beginning and 120.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2975.18 ms. Allocated memory was 153.1 MB in the beginning and 190.8 MB in the end (delta: 37.7 MB). Free memory was 120.2 MB in the beginning and 108.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 77.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 57463.07 ms. Allocated memory was 190.8 MB in the beginning and 348.1 MB in the end (delta: 157.3 MB). Free memory was 108.3 MB in the beginning and 230.1 MB in the end (delta: -121.7 MB). Peak memory consumption was 35.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1396 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 105 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 42.3s, 126 PlacesBefore, 44 PlacesAfterwards, 116 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 7247 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 a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1525; [L835] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1526; [L837] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1527; [L839] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1528; [L841] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L812] 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) [L812] 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) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 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 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 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 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L782] 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) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] 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) [L782] 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) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 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 [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 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 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] 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) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] 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) [L847] 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) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 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 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 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 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 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) [L858] 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) [L859] 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)) [L859] 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)) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 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)) [L864] 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)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix057_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=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, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 57.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 42.5s, HoareTripleCheckerStatistics: 580 SDtfs, 600 SDslu, 896 SDs, 0 SdLazy, 405 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 548 GetRequests, 448 SyntacticMatches, 31 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 648 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 29240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...