/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 00:49:50,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 00:49:50,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 00:49:50,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 00:49:50,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 00:49:50,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 00:49:50,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 00:49:50,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 00:49:50,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 00:49:50,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 00:49:50,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 00:49:50,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 00:49:50,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 00:49:50,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 00:49:50,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 00:49:50,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 00:49:50,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 00:49:50,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 00:49:50,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 00:49:50,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 00:49:50,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 00:49:50,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 00:49:50,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 00:49:50,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 00:49:50,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 00:49:50,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 00:49:50,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 00:49:50,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 00:49:50,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 00:49:50,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 00:49:50,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 00:49:50,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 00:49:50,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 00:49:50,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 00:49:50,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 00:49:50,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 00:49:50,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 00:49:50,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 00:49:50,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 00:49:50,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 00:49:50,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 00:49:50,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-06 00:49:50,695 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 00:49:50,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 00:49:50,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-06 00:49:50,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-06 00:49:50,697 INFO L138 SettingsManager]: * Use SBE=true [2021-05-06 00:49:50,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 00:49:50,697 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 00:49:50,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 00:49:50,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 00:49:50,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 00:49:50,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 00:49:50,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 00:49:50,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 00:49:50,698 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 00:49:50,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 00:49:50,698 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 00:49:50,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 00:49:50,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 00:49:50,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 00:49:50,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 00:49:50,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 00:49:50,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 00:49:50,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-06 00:49:50,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-06 00:49:50,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-06 00:49:50,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-06 00:49:50,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 00:49:50,711 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-06 00:49:50,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-06 00:49:50,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 00:49:50,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 00:49:50,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 00:49:50,960 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 00:49:50,960 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 00:49:50,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2021-05-06 00:49:51,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b441188/ba9199a4531f4a69bd6b0fa7c4c82a0e/FLAG07df25a71 [2021-05-06 00:49:51,362 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 00:49:51,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2021-05-06 00:49:51,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b441188/ba9199a4531f4a69bd6b0fa7c4c82a0e/FLAG07df25a71 [2021-05-06 00:49:51,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b441188/ba9199a4531f4a69bd6b0fa7c4c82a0e [2021-05-06 00:49:51,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 00:49:51,792 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 00:49:51,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 00:49:51,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 00:49:51,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 00:49:51,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:49:51" (1/1) ... [2021-05-06 00:49:51,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de4f61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:49:51, skipping insertion in model container [2021-05-06 00:49:51,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:49:51" (1/1) ... [2021-05-06 00:49:51,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 00:49:51,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 00:49:51,890 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2021-05-06 00:49:51,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 00:49:51,910 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 00:49:51,926 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2021-05-06 00:49:51,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 00:49:51,943 INFO L208 MainTranslator]: Completed translation [2021-05-06 00:49:51,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:49:51 WrapperNode [2021-05-06 00:49:51,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 00:49:51,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 00:49:51,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 00:49:51,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 00:49:51,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:49:51" (1/1) ... [2021-05-06 00:49:51,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:49:51" (1/1) ... [2021-05-06 00:49:51,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:49:51" (1/1) ... [2021-05-06 00:49:51,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:49:51" (1/1) ... [2021-05-06 00:49:51,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:49:51" (1/1) ... [2021-05-06 00:49:51,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:49:51" (1/1) ... [2021-05-06 00:49:51,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:49:51" (1/1) ... [2021-05-06 00:49:51,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 00:49:51,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 00:49:51,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 00:49:51,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 00:49:51,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:49:51" (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 [2021-05-06 00:49:52,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 00:49:52,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 00:49:52,031 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 00:49:52,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 00:49:52,032 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-06 00:49:52,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 00:49:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 00:49:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 00:49:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 00:49:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 00:49:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 00:49:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 00:49:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 00:49:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 00:49:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 00:49:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 00:49:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 00:49:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 00:49:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 00:49:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 00:49:52,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 00:49:52,317 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-06 00:49:52,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:49:52 BoogieIcfgContainer [2021-05-06 00:49:52,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 00:49:52,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 00:49:52,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 00:49:52,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 00:49:52,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 12:49:51" (1/3) ... [2021-05-06 00:49:52,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38077eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:49:52, skipping insertion in model container [2021-05-06 00:49:52,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:49:51" (2/3) ... [2021-05-06 00:49:52,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38077eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:49:52, skipping insertion in model container [2021-05-06 00:49:52,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:49:52" (3/3) ... [2021-05-06 00:49:52,322 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2021-05-06 00:49:52,327 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-06 00:49:52,329 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 00:49:52,339 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 00:49:52,353 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 00:49:52,353 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 00:49:52,353 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-06 00:49:52,353 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 00:49:52,353 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 00:49:52,353 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 00:49:52,354 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 00:49:52,354 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 00:49:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-06 00:49:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-06 00:49:52,367 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:52,367 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:49:52,368 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:52,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1039138334, now seen corresponding path program 1 times [2021-05-06 00:49:52,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:52,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692705811] [2021-05-06 00:49:52,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:52,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:52,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:52,573 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:52,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692705811] [2021-05-06 00:49:52,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692705811] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 00:49:52,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 00:49:52,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-06 00:49:52,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105543502] [2021-05-06 00:49:52,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-06 00:49:52,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:52,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-06 00:49:52,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-06 00:49:52,587 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:49:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:52,674 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2021-05-06 00:49:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-06 00:49:52,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2021-05-06 00:49:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:52,680 INFO L225 Difference]: With dead ends: 50 [2021-05-06 00:49:52,680 INFO L226 Difference]: Without dead ends: 27 [2021-05-06 00:49:52,682 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-06 00:49:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-06 00:49:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-06 00:49:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-06 00:49:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-05-06 00:49:52,715 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2021-05-06 00:49:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:52,715 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-05-06 00:49:52,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:49:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-05-06 00:49:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-06 00:49:52,717 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:52,717 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:49:52,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 00:49:52,717 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash 677978447, now seen corresponding path program 1 times [2021-05-06 00:49:52,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:52,719 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265691752] [2021-05-06 00:49:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:52,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:52,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:52,844 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:52,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265691752] [2021-05-06 00:49:52,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265691752] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 00:49:52,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 00:49:52,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 00:49:52,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254458492] [2021-05-06 00:49:52,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 00:49:52,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:52,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 00:49:52,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-06 00:49:52,847 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 00:49:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:53,017 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2021-05-06 00:49:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 00:49:53,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-05-06 00:49:53,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:53,019 INFO L225 Difference]: With dead ends: 46 [2021-05-06 00:49:53,019 INFO L226 Difference]: Without dead ends: 31 [2021-05-06 00:49:53,019 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 62.9ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-06 00:49:53,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-06 00:49:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-05-06 00:49:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-06 00:49:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-05-06 00:49:53,024 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2021-05-06 00:49:53,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:53,024 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-05-06 00:49:53,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 00:49:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-05-06 00:49:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-06 00:49:53,025 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:53,025 INFO L523 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] [2021-05-06 00:49:53,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 00:49:53,025 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:53,025 INFO L82 PathProgramCache]: Analyzing trace with hash -673447056, now seen corresponding path program 1 times [2021-05-06 00:49:53,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:53,026 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526953103] [2021-05-06 00:49:53,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:53,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:53,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-06 00:49:53,096 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:53,096 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526953103] [2021-05-06 00:49:53,096 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526953103] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 00:49:53,096 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 00:49:53,097 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 00:49:53,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362512920] [2021-05-06 00:49:53,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 00:49:53,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:53,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 00:49:53,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 00:49:53,098 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:49:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:53,192 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2021-05-06 00:49:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 00:49:53,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-05-06 00:49:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:53,194 INFO L225 Difference]: With dead ends: 49 [2021-05-06 00:49:53,194 INFO L226 Difference]: Without dead ends: 33 [2021-05-06 00:49:53,195 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 00:49:53,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-06 00:49:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-05-06 00:49:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-06 00:49:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-05-06 00:49:53,201 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2021-05-06 00:49:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:53,201 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-05-06 00:49:53,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:49:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2021-05-06 00:49:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-06 00:49:53,202 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:53,202 INFO L523 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] [2021-05-06 00:49:53,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 00:49:53,202 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:53,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1101560306, now seen corresponding path program 1 times [2021-05-06 00:49:53,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:53,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799448800] [2021-05-06 00:49:53,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:53,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:53,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-06 00:49:53,302 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:53,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799448800] [2021-05-06 00:49:53,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799448800] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 00:49:53,302 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 00:49:53,302 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 00:49:53,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006184959] [2021-05-06 00:49:53,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 00:49:53,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 00:49:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 00:49:53,304 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 00:49:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:53,458 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2021-05-06 00:49:53,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 00:49:53,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2021-05-06 00:49:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:53,461 INFO L225 Difference]: With dead ends: 57 [2021-05-06 00:49:53,461 INFO L226 Difference]: Without dead ends: 40 [2021-05-06 00:49:53,462 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 69.9ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-05-06 00:49:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-06 00:49:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-05-06 00:49:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-06 00:49:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2021-05-06 00:49:53,477 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2021-05-06 00:49:53,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:53,478 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2021-05-06 00:49:53,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 00:49:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2021-05-06 00:49:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-06 00:49:53,480 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:53,480 INFO L523 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] [2021-05-06 00:49:53,481 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 00:49:53,481 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1103407348, now seen corresponding path program 1 times [2021-05-06 00:49:53,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:53,482 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129543956] [2021-05-06 00:49:53,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:53,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:53,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:53,585 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:53,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129543956] [2021-05-06 00:49:53,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129543956] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:53,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592440897] [2021-05-06 00:49:53,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:53,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-06 00:49:53,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:49:53,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:53,731 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:53,752 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:53,768 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592440897] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:53,769 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:49:53,769 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2021-05-06 00:49:53,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019429062] [2021-05-06 00:49:53,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-06 00:49:53,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:53,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-06 00:49:53,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 00:49:53,770 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:49:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:53,882 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2021-05-06 00:49:53,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 00:49:53,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2021-05-06 00:49:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:53,883 INFO L225 Difference]: With dead ends: 79 [2021-05-06 00:49:53,883 INFO L226 Difference]: Without dead ends: 51 [2021-05-06 00:49:53,884 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 82.5ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-05-06 00:49:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-06 00:49:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2021-05-06 00:49:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-06 00:49:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2021-05-06 00:49:53,900 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 24 [2021-05-06 00:49:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:53,902 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2021-05-06 00:49:53,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:49:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2021-05-06 00:49:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-06 00:49:53,903 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:53,903 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:49:54,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:54,104 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:54,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1809680179, now seen corresponding path program 2 times [2021-05-06 00:49:54,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:54,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212088070] [2021-05-06 00:49:54,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:54,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:54,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:54,178 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:54,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212088070] [2021-05-06 00:49:54,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212088070] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:54,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525823854] [2021-05-06 00:49:54,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:54,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 00:49:54,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:49:54,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-06 00:49:54,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:49:54,280 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:54,292 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-06 00:49:54,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525823854] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 00:49:54,310 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-06 00:49:54,310 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2021-05-06 00:49:54,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368771081] [2021-05-06 00:49:54,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 00:49:54,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:54,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 00:49:54,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-06 00:49:54,312 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:49:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:54,393 INFO L93 Difference]: Finished difference Result 122 states and 169 transitions. [2021-05-06 00:49:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 00:49:54,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-05-06 00:49:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:54,394 INFO L225 Difference]: With dead ends: 122 [2021-05-06 00:49:54,394 INFO L226 Difference]: Without dead ends: 88 [2021-05-06 00:49:54,394 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 60.8ms TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-05-06 00:49:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-05-06 00:49:54,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2021-05-06 00:49:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-06 00:49:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2021-05-06 00:49:54,402 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 27 [2021-05-06 00:49:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:54,402 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2021-05-06 00:49:54,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:49:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2021-05-06 00:49:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-06 00:49:54,403 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:54,403 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:49:54,608 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:54,609 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:54,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:54,609 INFO L82 PathProgramCache]: Analyzing trace with hash 829847155, now seen corresponding path program 1 times [2021-05-06 00:49:54,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:54,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024890712] [2021-05-06 00:49:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:54,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:54,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-05-06 00:49:54,658 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:54,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024890712] [2021-05-06 00:49:54,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024890712] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 00:49:54,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 00:49:54,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 00:49:54,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561792489] [2021-05-06 00:49:54,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 00:49:54,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:54,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 00:49:54,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 00:49:54,659 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:49:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:54,722 INFO L93 Difference]: Finished difference Result 161 states and 220 transitions. [2021-05-06 00:49:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 00:49:54,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-05-06 00:49:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:54,726 INFO L225 Difference]: With dead ends: 161 [2021-05-06 00:49:54,726 INFO L226 Difference]: Without dead ends: 97 [2021-05-06 00:49:54,726 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 00:49:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-06 00:49:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2021-05-06 00:49:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-06 00:49:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2021-05-06 00:49:54,748 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 27 [2021-05-06 00:49:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:54,748 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2021-05-06 00:49:54,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:49:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2021-05-06 00:49:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-06 00:49:54,749 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:54,749 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:49:54,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-06 00:49:54,749 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:54,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1640504642, now seen corresponding path program 1 times [2021-05-06 00:49:54,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:54,750 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945686606] [2021-05-06 00:49:54,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:54,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:54,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:54,832 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:54,832 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945686606] [2021-05-06 00:49:54,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945686606] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:54,832 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874704682] [2021-05-06 00:49:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:54,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-06 00:49:54,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:49:54,919 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:54,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:54,941 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:54,943 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:54,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:54,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874704682] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:54,968 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:49:54,968 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-05-06 00:49:54,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864630125] [2021-05-06 00:49:54,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-06 00:49:54,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:54,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-06 00:49:54,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-06 00:49:54,969 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:49:55,093 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-06 00:49:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:55,292 INFO L93 Difference]: Finished difference Result 191 states and 259 transitions. [2021-05-06 00:49:55,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 00:49:55,292 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2021-05-06 00:49:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:55,293 INFO L225 Difference]: With dead ends: 191 [2021-05-06 00:49:55,293 INFO L226 Difference]: Without dead ends: 117 [2021-05-06 00:49:55,294 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 174.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-05-06 00:49:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-06 00:49:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2021-05-06 00:49:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 92 states have (on average 1.326086956521739) internal successors, (122), 93 states have internal predecessors, (122), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-06 00:49:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-05-06 00:49:55,299 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 28 [2021-05-06 00:49:55,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:55,300 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-05-06 00:49:55,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:49:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-05-06 00:49:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-06 00:49:55,300 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:55,300 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:49:55,516 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:55,517 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:55,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:55,517 INFO L82 PathProgramCache]: Analyzing trace with hash 942246269, now seen corresponding path program 2 times [2021-05-06 00:49:55,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:55,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166033961] [2021-05-06 00:49:55,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:55,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:55,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:55,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:55,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166033961] [2021-05-06 00:49:55,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166033961] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:55,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185081850] [2021-05-06 00:49:55,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:55,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 00:49:55,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:49:55,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-06 00:49:55,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:49:55,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:55,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:55,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:55,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-05-06 00:49:55,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185081850] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:55,718 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:49:55,718 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2021-05-06 00:49:55,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169299540] [2021-05-06 00:49:55,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-06 00:49:55,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:55,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-06 00:49:55,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-05-06 00:49:55,719 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-06 00:49:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:56,263 INFO L93 Difference]: Finished difference Result 317 states and 430 transitions. [2021-05-06 00:49:56,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-06 00:49:56,263 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-05-06 00:49:56,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:56,264 INFO L225 Difference]: With dead ends: 317 [2021-05-06 00:49:56,264 INFO L226 Difference]: Without dead ends: 225 [2021-05-06 00:49:56,265 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 373.4ms TimeCoverageRelationStatistics Valid=320, Invalid=940, Unknown=0, NotChecked=0, Total=1260 [2021-05-06 00:49:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-05-06 00:49:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2021-05-06 00:49:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 157 states have (on average 1.305732484076433) internal successors, (205), 158 states have internal predecessors, (205), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 00:49:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 222 transitions. [2021-05-06 00:49:56,274 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 222 transitions. Word has length 31 [2021-05-06 00:49:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:56,274 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 222 transitions. [2021-05-06 00:49:56,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-06 00:49:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2021-05-06 00:49:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-06 00:49:56,275 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:56,275 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:49:56,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:56,483 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:56,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1473818596, now seen corresponding path program 1 times [2021-05-06 00:49:56,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:56,484 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032963583] [2021-05-06 00:49:56,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:56,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:56,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:56,561 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:56,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032963583] [2021-05-06 00:49:56,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032963583] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:56,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435293181] [2021-05-06 00:49:56,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:56,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-06 00:49:56,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:49:56,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:56,637 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:56,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:56,654 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:56,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:56,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:56,688 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:56,690 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:56,703 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:56,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435293181] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:56,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:49:56,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-05-06 00:49:56,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833971410] [2021-05-06 00:49:56,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-06 00:49:56,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:56,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-06 00:49:56,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-05-06 00:49:56,723 INFO L87 Difference]: Start difference. First operand 172 states and 222 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:49:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:56,875 INFO L93 Difference]: Finished difference Result 371 states and 487 transitions. [2021-05-06 00:49:56,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 00:49:56,875 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2021-05-06 00:49:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:56,876 INFO L225 Difference]: With dead ends: 371 [2021-05-06 00:49:56,876 INFO L226 Difference]: Without dead ends: 211 [2021-05-06 00:49:56,878 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 99.8ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-05-06 00:49:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-05-06 00:49:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2021-05-06 00:49:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 177 states have (on average 1.2824858757062148) internal successors, (227), 178 states have internal predecessors, (227), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 00:49:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 244 transitions. [2021-05-06 00:49:56,900 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 244 transitions. Word has length 34 [2021-05-06 00:49:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:56,901 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 244 transitions. [2021-05-06 00:49:56,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:49:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 244 transitions. [2021-05-06 00:49:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-06 00:49:56,902 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:56,902 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:49:57,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-05-06 00:49:57,105 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:57,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:57,105 INFO L82 PathProgramCache]: Analyzing trace with hash 193637275, now seen corresponding path program 2 times [2021-05-06 00:49:57,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:57,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212206306] [2021-05-06 00:49:57,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:57,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:57,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:57,180 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:57,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212206306] [2021-05-06 00:49:57,180 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212206306] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:57,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548964296] [2021-05-06 00:49:57,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:57,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 00:49:57,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:49:57,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2021-05-06 00:49:57,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:49:57,252 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:57,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:57,269 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:57,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:57,284 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:57,286 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:57,300 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:57,303 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:57,318 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:57,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:57,332 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:57,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548964296] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:57,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:49:57,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-05-06 00:49:57,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387333128] [2021-05-06 00:49:57,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-06 00:49:57,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:57,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-06 00:49:57,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2021-05-06 00:49:57,345 INFO L87 Difference]: Start difference. First operand 192 states and 244 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:49:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:57,484 INFO L93 Difference]: Finished difference Result 419 states and 545 transitions. [2021-05-06 00:49:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-06 00:49:57,484 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2021-05-06 00:49:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:57,485 INFO L225 Difference]: With dead ends: 419 [2021-05-06 00:49:57,486 INFO L226 Difference]: Without dead ends: 239 [2021-05-06 00:49:57,486 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 106.0ms TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2021-05-06 00:49:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-05-06 00:49:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 216. [2021-05-06 00:49:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 201 states have (on average 1.2786069651741294) internal successors, (257), 202 states have internal predecessors, (257), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 00:49:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 274 transitions. [2021-05-06 00:49:57,517 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 274 transitions. Word has length 37 [2021-05-06 00:49:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:57,517 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 274 transitions. [2021-05-06 00:49:57,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:49:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 274 transitions. [2021-05-06 00:49:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-06 00:49:57,518 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:57,518 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:49:57,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:57,729 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:57,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:57,729 INFO L82 PathProgramCache]: Analyzing trace with hash -220255300, now seen corresponding path program 3 times [2021-05-06 00:49:57,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:57,729 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066134677] [2021-05-06 00:49:57,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:57,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:57,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:57,827 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:57,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066134677] [2021-05-06 00:49:57,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066134677] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:57,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544825077] [2021-05-06 00:49:57,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:57,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-06 00:49:57,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:49:57,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-06 00:49:57,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:49:57,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-05-06 00:49:57,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544825077] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 00:49:57,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-06 00:49:57,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2021-05-06 00:49:57,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753344056] [2021-05-06 00:49:57,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 00:49:57,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:57,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 00:49:57,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-05-06 00:49:57,963 INFO L87 Difference]: Start difference. First operand 216 states and 274 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:49:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:58,007 INFO L93 Difference]: Finished difference Result 301 states and 377 transitions. [2021-05-06 00:49:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 00:49:58,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-05-06 00:49:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:58,009 INFO L225 Difference]: With dead ends: 301 [2021-05-06 00:49:58,009 INFO L226 Difference]: Without dead ends: 211 [2021-05-06 00:49:58,010 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 97.2ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-05-06 00:49:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-05-06 00:49:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2021-05-06 00:49:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 195 states have (on average 1.2564102564102564) internal successors, (245), 196 states have internal predecessors, (245), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 00:49:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 262 transitions. [2021-05-06 00:49:58,020 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 262 transitions. Word has length 40 [2021-05-06 00:49:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:58,020 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 262 transitions. [2021-05-06 00:49:58,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:49:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 262 transitions. [2021-05-06 00:49:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-06 00:49:58,022 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:58,023 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:49:58,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:58,239 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash -158215686, now seen corresponding path program 1 times [2021-05-06 00:49:58,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:58,239 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890195488] [2021-05-06 00:49:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:58,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:58,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:58,331 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:58,331 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890195488] [2021-05-06 00:49:58,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890195488] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:58,331 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759437752] [2021-05-06 00:49:58,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:58,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-06 00:49:58,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:49:58,448 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,464 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,478 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,496 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,498 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,514 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,517 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,534 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:58,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759437752] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:58,557 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:49:58,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-05-06 00:49:58,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866100102] [2021-05-06 00:49:58,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-06 00:49:58,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:58,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-06 00:49:58,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2021-05-06 00:49:58,558 INFO L87 Difference]: Start difference. First operand 210 states and 262 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:49:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:58,740 INFO L93 Difference]: Finished difference Result 455 states and 581 transitions. [2021-05-06 00:49:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-06 00:49:58,740 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2021-05-06 00:49:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:58,741 INFO L225 Difference]: With dead ends: 455 [2021-05-06 00:49:58,741 INFO L226 Difference]: Without dead ends: 257 [2021-05-06 00:49:58,742 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 124.1ms TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2021-05-06 00:49:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-05-06 00:49:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 234. [2021-05-06 00:49:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 219 states have (on average 1.2557077625570776) internal successors, (275), 220 states have internal predecessors, (275), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 00:49:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 292 transitions. [2021-05-06 00:49:58,750 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 292 transitions. Word has length 40 [2021-05-06 00:49:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:58,750 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 292 transitions. [2021-05-06 00:49:58,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:49:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2021-05-06 00:49:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-06 00:49:58,751 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:58,751 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:49:58,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-05-06 00:49:58,968 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:58,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:58,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1743353085, now seen corresponding path program 2 times [2021-05-06 00:49:58,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:58,968 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419411369] [2021-05-06 00:49:58,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:59,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:59,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:59,083 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:59,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419411369] [2021-05-06 00:49:59,083 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419411369] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:59,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785741033] [2021-05-06 00:49:59,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:59,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 00:49:59,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:49:59,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2021-05-06 00:49:59,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:49:59,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,191 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,193 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,227 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,246 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,247 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,263 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,278 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:59,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785741033] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:59,287 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:49:59,287 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-05-06 00:49:59,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683885577] [2021-05-06 00:49:59,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-06 00:49:59,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:49:59,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-06 00:49:59,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2021-05-06 00:49:59,288 INFO L87 Difference]: Start difference. First operand 234 states and 292 transitions. Second operand has 20 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:49:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:49:59,468 INFO L93 Difference]: Finished difference Result 503 states and 641 transitions. [2021-05-06 00:49:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-06 00:49:59,469 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2021-05-06 00:49:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:49:59,470 INFO L225 Difference]: With dead ends: 503 [2021-05-06 00:49:59,470 INFO L226 Difference]: Without dead ends: 281 [2021-05-06 00:49:59,470 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 142.8ms TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2021-05-06 00:49:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-05-06 00:49:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 258. [2021-05-06 00:49:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 243 states have (on average 1.2551440329218106) internal successors, (305), 244 states have internal predecessors, (305), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 00:49:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 322 transitions. [2021-05-06 00:49:59,479 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 322 transitions. Word has length 43 [2021-05-06 00:49:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:49:59,479 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 322 transitions. [2021-05-06 00:49:59,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:49:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 322 transitions. [2021-05-06 00:49:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-06 00:49:59,480 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:49:59,480 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:49:59,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:59,693 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:49:59,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:49:59,693 INFO L82 PathProgramCache]: Analyzing trace with hash 759975706, now seen corresponding path program 3 times [2021-05-06 00:49:59,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:49:59,693 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248224321] [2021-05-06 00:49:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:49:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:59,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:49:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:59,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:49:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:49:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:49:59,792 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:49:59,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248224321] [2021-05-06 00:49:59,792 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248224321] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:49:59,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232336925] [2021-05-06 00:49:59,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:49:59,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-06 00:49:59,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:49:59,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 14 conjunts are in the unsatisfiable core [2021-05-06 00:49:59,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:49:59,913 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,919 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,966 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,968 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,974 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:49:59,987 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-05-06 00:50:00,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232336925] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 00:50:00,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-06 00:50:00,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2021-05-06 00:50:00,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623356855] [2021-05-06 00:50:00,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 00:50:00,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:00,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 00:50:00,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2021-05-06 00:50:00,007 INFO L87 Difference]: Start difference. First operand 258 states and 322 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:50:00,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:00,087 INFO L93 Difference]: Finished difference Result 341 states and 421 transitions. [2021-05-06 00:50:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 00:50:00,087 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2021-05-06 00:50:00,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:00,089 INFO L225 Difference]: With dead ends: 341 [2021-05-06 00:50:00,089 INFO L226 Difference]: Without dead ends: 339 [2021-05-06 00:50:00,089 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 141.2ms TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-05-06 00:50:00,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-05-06 00:50:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2021-05-06 00:50:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 313 states have (on average 1.2396166134185302) internal successors, (388), 317 states have internal predecessors, (388), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-06 00:50:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 413 transitions. [2021-05-06 00:50:00,099 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 413 transitions. Word has length 46 [2021-05-06 00:50:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:00,100 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 413 transitions. [2021-05-06 00:50:00,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:50:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 413 transitions. [2021-05-06 00:50:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-06 00:50:00,100 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:00,100 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:00,317 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-05-06 00:50:00,317 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:00,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2089980700, now seen corresponding path program 1 times [2021-05-06 00:50:00,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:00,318 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818318648] [2021-05-06 00:50:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:00,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:00,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:50:00,438 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:00,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818318648] [2021-05-06 00:50:00,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818318648] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:00,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797085674] [2021-05-06 00:50:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:00,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-06 00:50:00,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:00,507 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,508 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,523 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,536 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,537 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,551 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,553 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,568 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,569 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,584 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,585 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,601 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,618 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:50:00,643 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797085674] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:00,643 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:00,643 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2021-05-06 00:50:00,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062469029] [2021-05-06 00:50:00,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-06 00:50:00,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:00,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-06 00:50:00,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2021-05-06 00:50:00,644 INFO L87 Difference]: Start difference. First operand 335 states and 413 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:50:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:01,146 INFO L93 Difference]: Finished difference Result 771 states and 971 transitions. [2021-05-06 00:50:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-06 00:50:01,147 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2021-05-06 00:50:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:01,149 INFO L225 Difference]: With dead ends: 771 [2021-05-06 00:50:01,150 INFO L226 Difference]: Without dead ends: 496 [2021-05-06 00:50:01,151 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 380.5ms TimeCoverageRelationStatistics Valid=431, Invalid=1209, Unknown=0, NotChecked=0, Total=1640 [2021-05-06 00:50:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-05-06 00:50:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 451. [2021-05-06 00:50:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 424 states have (on average 1.2429245283018868) internal successors, (527), 429 states have internal predecessors, (527), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-06 00:50:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 558 transitions. [2021-05-06 00:50:01,167 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 558 transitions. Word has length 46 [2021-05-06 00:50:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:01,167 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 558 transitions. [2021-05-06 00:50:01,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:50:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 558 transitions. [2021-05-06 00:50:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-06 00:50:01,167 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:01,167 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:01,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-05-06 00:50:01,384 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:01,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:01,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1753798755, now seen corresponding path program 2 times [2021-05-06 00:50:01,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:01,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236722203] [2021-05-06 00:50:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:01,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:01,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:50:01,494 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:01,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236722203] [2021-05-06 00:50:01,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236722203] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:01,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742943771] [2021-05-06 00:50:01,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:01,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 00:50:01,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:01,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-06 00:50:01,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:01,569 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,589 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,633 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,650 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,665 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,666 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,703 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,753 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,767 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,781 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:50:01,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742943771] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:01,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:01,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-06 00:50:01,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036908794] [2021-05-06 00:50:01,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-06 00:50:01,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:01,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-06 00:50:01,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2021-05-06 00:50:01,790 INFO L87 Difference]: Start difference. First operand 451 states and 558 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:50:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:02,262 INFO L93 Difference]: Finished difference Result 924 states and 1156 transitions. [2021-05-06 00:50:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-06 00:50:02,265 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2021-05-06 00:50:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:02,267 INFO L225 Difference]: With dead ends: 924 [2021-05-06 00:50:02,268 INFO L226 Difference]: Without dead ends: 652 [2021-05-06 00:50:02,269 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 382.5ms TimeCoverageRelationStatistics Valid=376, Invalid=1030, Unknown=0, NotChecked=0, Total=1406 [2021-05-06 00:50:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2021-05-06 00:50:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 458. [2021-05-06 00:50:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 431 states have (on average 1.2552204176334107) internal successors, (541), 436 states have internal predecessors, (541), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-06 00:50:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 572 transitions. [2021-05-06 00:50:02,289 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 572 transitions. Word has length 49 [2021-05-06 00:50:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:02,289 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 572 transitions. [2021-05-06 00:50:02,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 00:50:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 572 transitions. [2021-05-06 00:50:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-06 00:50:02,289 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:02,289 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:02,504 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-05-06 00:50:02,505 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:02,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:02,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1921186147, now seen corresponding path program 1 times [2021-05-06 00:50:02,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:02,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314096697] [2021-05-06 00:50:02,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:02,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:02,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-05-06 00:50:02,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:02,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314096697] [2021-05-06 00:50:02,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314096697] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 00:50:02,569 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 00:50:02,569 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 00:50:02,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467752882] [2021-05-06 00:50:02,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 00:50:02,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:02,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 00:50:02,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 00:50:02,570 INFO L87 Difference]: Start difference. First operand 458 states and 572 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 00:50:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:02,681 INFO L93 Difference]: Finished difference Result 808 states and 1023 transitions. [2021-05-06 00:50:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 00:50:02,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-06 00:50:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:02,683 INFO L225 Difference]: With dead ends: 808 [2021-05-06 00:50:02,684 INFO L226 Difference]: Without dead ends: 624 [2021-05-06 00:50:02,684 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 68.4ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-05-06 00:50:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-05-06 00:50:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 493. [2021-05-06 00:50:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 465 states have (on average 1.2580645161290323) internal successors, (585), 470 states have internal predecessors, (585), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-06 00:50:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 618 transitions. [2021-05-06 00:50:02,700 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 618 transitions. Word has length 49 [2021-05-06 00:50:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:02,700 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 618 transitions. [2021-05-06 00:50:02,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 00:50:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 618 transitions. [2021-05-06 00:50:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-06 00:50:02,700 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:02,701 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:02,701 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-06 00:50:02,701 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:02,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:02,701 INFO L82 PathProgramCache]: Analyzing trace with hash 630503292, now seen corresponding path program 3 times [2021-05-06 00:50:02,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:02,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096144405] [2021-05-06 00:50:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:02,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:02,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:50:02,812 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:02,812 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096144405] [2021-05-06 00:50:02,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096144405] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:02,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168526380] [2021-05-06 00:50:02,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:02,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-06 00:50:02,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:02,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2021-05-06 00:50:02,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:03,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,046 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,068 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,070 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,073 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,088 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-05-06 00:50:03,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168526380] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 00:50:03,102 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-06 00:50:03,102 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2021-05-06 00:50:03,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39092064] [2021-05-06 00:50:03,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 00:50:03,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 00:50:03,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-05-06 00:50:03,103 INFO L87 Difference]: Start difference. First operand 493 states and 618 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:50:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:03,181 INFO L93 Difference]: Finished difference Result 504 states and 629 transitions. [2021-05-06 00:50:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 00:50:03,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2021-05-06 00:50:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:03,183 INFO L225 Difference]: With dead ends: 504 [2021-05-06 00:50:03,183 INFO L226 Difference]: Without dead ends: 502 [2021-05-06 00:50:03,183 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 194.7ms TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2021-05-06 00:50:03,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-05-06 00:50:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 493. [2021-05-06 00:50:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 465 states have (on average 1.2580645161290323) internal successors, (585), 470 states have internal predecessors, (585), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-06 00:50:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 618 transitions. [2021-05-06 00:50:03,199 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 618 transitions. Word has length 52 [2021-05-06 00:50:03,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:03,199 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 618 transitions. [2021-05-06 00:50:03,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 00:50:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 618 transitions. [2021-05-06 00:50:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-06 00:50:03,209 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:03,209 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:03,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-05-06 00:50:03,413 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:03,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:03,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1644049929, now seen corresponding path program 1 times [2021-05-06 00:50:03,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:03,414 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686110299] [2021-05-06 00:50:03,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:03,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:03,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:03,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-05-06 00:50:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 265 proven. 117 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-05-06 00:50:03,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:03,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686110299] [2021-05-06 00:50:03,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686110299] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:03,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076894769] [2021-05-06 00:50:03,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:03,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2021-05-06 00:50:03,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:03,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,636 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,668 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,721 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,722 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,737 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,739 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,756 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,760 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,781 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,823 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,840 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,846 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,861 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 263 proven. 117 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-05-06 00:50:03,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076894769] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:03,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:03,904 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-05-06 00:50:03,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068935932] [2021-05-06 00:50:03,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-06 00:50:03,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:03,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-06 00:50:03,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2021-05-06 00:50:03,905 INFO L87 Difference]: Start difference. First operand 493 states and 618 transitions. Second operand has 24 states, 24 states have (on average 3.625) internal successors, (87), 23 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:04,121 INFO L93 Difference]: Finished difference Result 964 states and 1223 transitions. [2021-05-06 00:50:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-06 00:50:04,122 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 23 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 87 [2021-05-06 00:50:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:04,123 INFO L225 Difference]: With dead ends: 964 [2021-05-06 00:50:04,123 INFO L226 Difference]: Without dead ends: 559 [2021-05-06 00:50:04,124 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 202.6ms TimeCoverageRelationStatistics Valid=214, Invalid=386, Unknown=0, NotChecked=0, Total=600 [2021-05-06 00:50:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-05-06 00:50:04,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 524. [2021-05-06 00:50:04,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 496 states have (on average 1.2459677419354838) internal successors, (618), 501 states have internal predecessors, (618), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-06 00:50:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 651 transitions. [2021-05-06 00:50:04,162 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 651 transitions. Word has length 87 [2021-05-06 00:50:04,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:04,162 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 651 transitions. [2021-05-06 00:50:04,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 23 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:04,163 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 651 transitions. [2021-05-06 00:50:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-06 00:50:04,163 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:04,163 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:04,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:04,364 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:04,364 INFO L82 PathProgramCache]: Analyzing trace with hash -218145757, now seen corresponding path program 2 times [2021-05-06 00:50:04,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:04,364 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284709482] [2021-05-06 00:50:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:04,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:04,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:04,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-06 00:50:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 324 proven. 145 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-05-06 00:50:04,493 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:04,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284709482] [2021-05-06 00:50:04,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284709482] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:04,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376786419] [2021-05-06 00:50:04,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:04,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 00:50:04,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:04,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-06 00:50:04,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:04,583 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,584 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,595 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,609 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,610 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,623 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,637 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,652 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,670 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,688 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,689 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,712 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,730 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,732 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,747 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 322 proven. 145 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-05-06 00:50:04,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376786419] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:04,786 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:04,786 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-06 00:50:04,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180376477] [2021-05-06 00:50:04,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-06 00:50:04,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:04,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-06 00:50:04,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2021-05-06 00:50:04,789 INFO L87 Difference]: Start difference. First operand 524 states and 651 transitions. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:04,968 INFO L93 Difference]: Finished difference Result 1052 states and 1329 transitions. [2021-05-06 00:50:04,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-06 00:50:04,968 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 93 [2021-05-06 00:50:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:04,970 INFO L225 Difference]: With dead ends: 1052 [2021-05-06 00:50:04,970 INFO L226 Difference]: Without dead ends: 612 [2021-05-06 00:50:04,971 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 216.9ms TimeCoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2021-05-06 00:50:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-05-06 00:50:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 569. [2021-05-06 00:50:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 541 states have (on average 1.243992606284658) internal successors, (673), 546 states have internal predecessors, (673), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-06 00:50:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 706 transitions. [2021-05-06 00:50:05,001 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 706 transitions. Word has length 93 [2021-05-06 00:50:05,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:05,001 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 706 transitions. [2021-05-06 00:50:05,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 706 transitions. [2021-05-06 00:50:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-06 00:50:05,003 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:05,003 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:05,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-05-06 00:50:05,212 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:05,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash -369554377, now seen corresponding path program 3 times [2021-05-06 00:50:05,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:05,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219677441] [2021-05-06 00:50:05,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:05,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:05,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:05,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-06 00:50:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 389 proven. 176 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-05-06 00:50:05,343 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:05,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219677441] [2021-05-06 00:50:05,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219677441] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:05,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820688655] [2021-05-06 00:50:05,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:05,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-06 00:50:05,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:05,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-06 00:50:05,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:05,613 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:05,615 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:05,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:05,681 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:05,690 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:05,705 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 33 proven. 392 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2021-05-06 00:50:05,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820688655] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:05,735 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:05,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 24 [2021-05-06 00:50:05,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654868504] [2021-05-06 00:50:05,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-06 00:50:05,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:05,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-06 00:50:05,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-05-06 00:50:05,748 INFO L87 Difference]: Start difference. First operand 569 states and 706 transitions. Second operand has 24 states, 24 states have (on average 3.625) internal successors, (87), 22 states have internal predecessors, (87), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-06 00:50:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:07,129 INFO L93 Difference]: Finished difference Result 1459 states and 1848 transitions. [2021-05-06 00:50:07,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-06 00:50:07,130 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 22 states have internal predecessors, (87), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 99 [2021-05-06 00:50:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:07,132 INFO L225 Difference]: With dead ends: 1459 [2021-05-06 00:50:07,132 INFO L226 Difference]: Without dead ends: 973 [2021-05-06 00:50:07,134 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 1040.3ms TimeCoverageRelationStatistics Valid=944, Invalid=3612, Unknown=0, NotChecked=0, Total=4556 [2021-05-06 00:50:07,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-05-06 00:50:07,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 916. [2021-05-06 00:50:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 877 states have (on average 1.242873432155074) internal successors, (1090), 884 states have internal predecessors, (1090), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 16 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-06 00:50:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1137 transitions. [2021-05-06 00:50:07,162 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1137 transitions. Word has length 99 [2021-05-06 00:50:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:07,162 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1137 transitions. [2021-05-06 00:50:07,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 22 states have internal predecessors, (87), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-06 00:50:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1137 transitions. [2021-05-06 00:50:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-06 00:50:07,163 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:07,164 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 12, 12, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:07,380 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:07,381 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:07,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:07,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1533593249, now seen corresponding path program 1 times [2021-05-06 00:50:07,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:07,381 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414915594] [2021-05-06 00:50:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:07,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:07,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:07,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-05-06 00:50:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 44 proven. 630 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2021-05-06 00:50:07,528 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:07,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414915594] [2021-05-06 00:50:07,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414915594] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:07,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403912585] [2021-05-06 00:50:07,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:07,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 15 conjunts are in the unsatisfiable core [2021-05-06 00:50:07,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:07,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,625 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,636 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,641 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,666 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,683 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,697 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,698 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,712 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,726 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,727 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,743 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,761 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,778 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,797 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,798 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,822 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 458 proven. 210 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-05-06 00:50:07,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403912585] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:07,864 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:07,864 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2021-05-06 00:50:07,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674416288] [2021-05-06 00:50:07,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-06 00:50:07,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:07,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-06 00:50:07,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=540, Unknown=0, NotChecked=0, Total=870 [2021-05-06 00:50:07,865 INFO L87 Difference]: Start difference. First operand 916 states and 1137 transitions. Second operand has 30 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 29 states have internal predecessors, (116), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:08,081 INFO L93 Difference]: Finished difference Result 1850 states and 2319 transitions. [2021-05-06 00:50:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-06 00:50:08,082 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 29 states have internal predecessors, (116), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 105 [2021-05-06 00:50:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:08,084 INFO L225 Difference]: With dead ends: 1850 [2021-05-06 00:50:08,084 INFO L226 Difference]: Without dead ends: 1026 [2021-05-06 00:50:08,086 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 273.4ms TimeCoverageRelationStatistics Valid=334, Invalid=596, Unknown=0, NotChecked=0, Total=930 [2021-05-06 00:50:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2021-05-06 00:50:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 964. [2021-05-06 00:50:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 925 states have (on average 1.241081081081081) internal successors, (1148), 932 states have internal predecessors, (1148), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 16 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-06 00:50:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1195 transitions. [2021-05-06 00:50:08,115 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1195 transitions. Word has length 105 [2021-05-06 00:50:08,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:08,115 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1195 transitions. [2021-05-06 00:50:08,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 29 states have internal predecessors, (116), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:08,115 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1195 transitions. [2021-05-06 00:50:08,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-06 00:50:08,116 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:08,116 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 13, 13, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:08,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-05-06 00:50:08,333 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1379214263, now seen corresponding path program 2 times [2021-05-06 00:50:08,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:08,333 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73965950] [2021-05-06 00:50:08,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:08,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:08,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:08,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-06 00:50:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 47 proven. 741 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-05-06 00:50:08,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:08,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73965950] [2021-05-06 00:50:08,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73965950] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:08,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583275089] [2021-05-06 00:50:08,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:08,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 00:50:08,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:08,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjunts are in the unsatisfiable core [2021-05-06 00:50:08,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:08,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,608 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,609 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,632 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,633 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,659 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,673 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,689 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,690 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,705 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,705 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,721 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,722 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,739 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,740 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,758 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,777 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,778 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 535 proven. 247 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2021-05-06 00:50:08,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583275089] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:08,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:08,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-05-06 00:50:08,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496138830] [2021-05-06 00:50:08,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-06 00:50:08,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:08,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-06 00:50:08,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=616, Unknown=0, NotChecked=0, Total=992 [2021-05-06 00:50:08,844 INFO L87 Difference]: Start difference. First operand 964 states and 1195 transitions. Second operand has 32 states, 32 states have (on average 3.8125) internal successors, (122), 31 states have internal predecessors, (122), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:09,103 INFO L93 Difference]: Finished difference Result 1960 states and 2460 transitions. [2021-05-06 00:50:09,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-06 00:50:09,103 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.8125) internal successors, (122), 31 states have internal predecessors, (122), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 111 [2021-05-06 00:50:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:09,106 INFO L225 Difference]: With dead ends: 1960 [2021-05-06 00:50:09,106 INFO L226 Difference]: Without dead ends: 1097 [2021-05-06 00:50:09,107 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 264.7ms TimeCoverageRelationStatistics Valid=380, Invalid=676, Unknown=0, NotChecked=0, Total=1056 [2021-05-06 00:50:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2021-05-06 00:50:09,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1033. [2021-05-06 00:50:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 994 states have (on average 1.2394366197183098) internal successors, (1232), 1001 states have internal predecessors, (1232), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 16 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-06 00:50:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1279 transitions. [2021-05-06 00:50:09,139 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1279 transitions. Word has length 111 [2021-05-06 00:50:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:09,139 INFO L480 AbstractCegarLoop]: Abstraction has 1033 states and 1279 transitions. [2021-05-06 00:50:09,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 3.8125) internal successors, (122), 31 states have internal predecessors, (122), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1279 transitions. [2021-05-06 00:50:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-05-06 00:50:09,141 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:09,141 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 14, 14, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:09,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-05-06 00:50:09,358 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:09,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:09,358 INFO L82 PathProgramCache]: Analyzing trace with hash 344085025, now seen corresponding path program 3 times [2021-05-06 00:50:09,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:09,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195656208] [2021-05-06 00:50:09,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:09,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:09,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:09,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-06 00:50:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 50 proven. 861 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2021-05-06 00:50:09,522 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:09,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195656208] [2021-05-06 00:50:09,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195656208] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:09,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230061958] [2021-05-06 00:50:09,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:09,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-06 00:50:09,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:09,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-06 00:50:09,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:09,657 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:09,726 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:09,770 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 624 proven. 41 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2021-05-06 00:50:09,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230061958] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:09,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:09,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7] total 24 [2021-05-06 00:50:09,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161617531] [2021-05-06 00:50:09,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-06 00:50:09,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:09,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-06 00:50:09,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2021-05-06 00:50:09,784 INFO L87 Difference]: Start difference. First operand 1033 states and 1279 transitions. Second operand has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 23 states have internal predecessors, (98), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-06 00:50:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:11,084 INFO L93 Difference]: Finished difference Result 2044 states and 2570 transitions. [2021-05-06 00:50:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-06 00:50:11,100 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 23 states have internal predecessors, (98), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 117 [2021-05-06 00:50:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:11,103 INFO L225 Difference]: With dead ends: 2044 [2021-05-06 00:50:11,103 INFO L226 Difference]: Without dead ends: 1121 [2021-05-06 00:50:11,106 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 1028.9ms TimeCoverageRelationStatistics Valid=1473, Invalid=4533, Unknown=0, NotChecked=0, Total=6006 [2021-05-06 00:50:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-05-06 00:50:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1022. [2021-05-06 00:50:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 979 states have (on average 1.1736465781409602) internal successors, (1149), 986 states have internal predecessors, (1149), 23 states have call successors, (23), 20 states have call predecessors, (23), 19 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-06 00:50:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1194 transitions. [2021-05-06 00:50:11,136 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1194 transitions. Word has length 117 [2021-05-06 00:50:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:11,136 INFO L480 AbstractCegarLoop]: Abstraction has 1022 states and 1194 transitions. [2021-05-06 00:50:11,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 23 states have internal predecessors, (98), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-06 00:50:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1194 transitions. [2021-05-06 00:50:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-06 00:50:11,137 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:11,137 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 29, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:11,354 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-05-06 00:50:11,354 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:11,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:11,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1048824823, now seen corresponding path program 4 times [2021-05-06 00:50:11,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:11,355 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264297962] [2021-05-06 00:50:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:11,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:11,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:11,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-05-06 00:50:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 710 proven. 330 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2021-05-06 00:50:11,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:11,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264297962] [2021-05-06 00:50:11,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264297962] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:11,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482157390] [2021-05-06 00:50:11,573 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:11,672 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-06 00:50:11,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:11,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 32 conjunts are in the unsatisfiable core [2021-05-06 00:50:11,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:11,701 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,721 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,736 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,737 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,753 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,754 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,772 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,790 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,792 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,809 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,810 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,831 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,832 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,850 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,852 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,878 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,898 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,955 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,956 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,982 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:11,983 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,007 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,057 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,058 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,081 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,082 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,106 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,129 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,191 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,192 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,215 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,240 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,241 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,278 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,279 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,305 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,339 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,397 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,398 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,432 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,433 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,462 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,463 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,504 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 398 proven. 976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:50:12,525 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482157390] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:12,525 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:12,525 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 33] total 52 [2021-05-06 00:50:12,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836884172] [2021-05-06 00:50:12,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-06 00:50:12,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:12,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-06 00:50:12,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2205, Unknown=0, NotChecked=0, Total=2652 [2021-05-06 00:50:12,527 INFO L87 Difference]: Start difference. First operand 1022 states and 1194 transitions. Second operand has 52 states, 52 states have (on average 3.326923076923077) internal successors, (173), 51 states have internal predecessors, (173), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-06 00:50:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:14,301 INFO L93 Difference]: Finished difference Result 1774 states and 2087 transitions. [2021-05-06 00:50:14,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-06 00:50:14,301 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.326923076923077) internal successors, (173), 51 states have internal predecessors, (173), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 123 [2021-05-06 00:50:14,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:14,304 INFO L225 Difference]: With dead ends: 1774 [2021-05-06 00:50:14,304 INFO L226 Difference]: Without dead ends: 1432 [2021-05-06 00:50:14,306 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2367 ImplicationChecksByTransitivity, 1788.7ms TimeCoverageRelationStatistics Valid=2044, Invalid=7856, Unknown=0, NotChecked=0, Total=9900 [2021-05-06 00:50:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2021-05-06 00:50:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 981. [2021-05-06 00:50:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 938 states have (on average 1.1865671641791045) internal successors, (1113), 945 states have internal predecessors, (1113), 23 states have call successors, (23), 20 states have call predecessors, (23), 19 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-06 00:50:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1158 transitions. [2021-05-06 00:50:14,337 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1158 transitions. Word has length 123 [2021-05-06 00:50:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:14,337 INFO L480 AbstractCegarLoop]: Abstraction has 981 states and 1158 transitions. [2021-05-06 00:50:14,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 3.326923076923077) internal successors, (173), 51 states have internal predecessors, (173), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-06 00:50:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1158 transitions. [2021-05-06 00:50:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-06 00:50:14,338 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:14,338 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:14,555 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-05-06 00:50:14,555 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:14,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:14,556 INFO L82 PathProgramCache]: Analyzing trace with hash -960099399, now seen corresponding path program 1 times [2021-05-06 00:50:14,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:14,556 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27066690] [2021-05-06 00:50:14,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:14,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:14,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:14,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-05-06 00:50:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 3 proven. 711 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2021-05-06 00:50:14,644 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:14,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27066690] [2021-05-06 00:50:14,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27066690] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:14,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199410926] [2021-05-06 00:50:14,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:14,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-06 00:50:14,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:14,733 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,734 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,745 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,746 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,758 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,770 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,784 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,798 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,812 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,813 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,828 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,843 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,844 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,860 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,861 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,878 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,894 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,895 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,913 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,914 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,932 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,952 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:14,979 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 707 proven. 330 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2021-05-06 00:50:15,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199410926] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:15,025 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:15,025 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19] total 23 [2021-05-06 00:50:15,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097337632] [2021-05-06 00:50:15,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-06 00:50:15,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:15,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-06 00:50:15,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2021-05-06 00:50:15,026 INFO L87 Difference]: Start difference. First operand 981 states and 1158 transitions. Second operand has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 22 states have internal predecessors, (95), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-06 00:50:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:16,051 INFO L93 Difference]: Finished difference Result 1983 states and 2330 transitions. [2021-05-06 00:50:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-05-06 00:50:16,051 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 22 states have internal predecessors, (95), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 123 [2021-05-06 00:50:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:16,054 INFO L225 Difference]: With dead ends: 1983 [2021-05-06 00:50:16,054 INFO L226 Difference]: Without dead ends: 1230 [2021-05-06 00:50:16,056 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 984.9ms TimeCoverageRelationStatistics Valid=1695, Invalid=3707, Unknown=0, NotChecked=0, Total=5402 [2021-05-06 00:50:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2021-05-06 00:50:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1069. [2021-05-06 00:50:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1025 states have (on average 1.1726829268292682) internal successors, (1202), 1032 states have internal predecessors, (1202), 24 states have call successors, (24), 20 states have call predecessors, (24), 19 states have return successors, (23), 16 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-06 00:50:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1249 transitions. [2021-05-06 00:50:16,095 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1249 transitions. Word has length 123 [2021-05-06 00:50:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:16,095 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 1249 transitions. [2021-05-06 00:50:16,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 22 states have internal predecessors, (95), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-06 00:50:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1249 transitions. [2021-05-06 00:50:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-05-06 00:50:16,096 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:16,096 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:16,304 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:16,305 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:16,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:16,305 INFO L82 PathProgramCache]: Analyzing trace with hash -436572509, now seen corresponding path program 1 times [2021-05-06 00:50:16,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:16,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786695004] [2021-05-06 00:50:16,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:16,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:16,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:16,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-05-06 00:50:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 805 proven. 376 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-05-06 00:50:16,510 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:16,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786695004] [2021-05-06 00:50:16,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786695004] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:16,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826062899] [2021-05-06 00:50:16,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:16,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2021-05-06 00:50:16,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:16,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,636 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,677 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,678 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,694 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,709 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,726 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,727 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,743 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,744 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,761 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,780 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,781 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,803 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,823 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,833 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,853 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,854 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,876 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,900 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,924 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:16,946 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 802 proven. 376 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2021-05-06 00:50:17,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826062899] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:17,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:17,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2021-05-06 00:50:17,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199375079] [2021-05-06 00:50:17,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-06 00:50:17,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:17,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-06 00:50:17,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=981, Unknown=0, NotChecked=0, Total=1482 [2021-05-06 00:50:17,004 INFO L87 Difference]: Start difference. First operand 1069 states and 1249 transitions. Second operand has 39 states, 39 states have (on average 3.3333333333333335) internal successors, (130), 38 states have internal predecessors, (130), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:17,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:17,815 INFO L93 Difference]: Finished difference Result 2227 states and 2640 transitions. [2021-05-06 00:50:17,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-06 00:50:17,816 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.3333333333333335) internal successors, (130), 38 states have internal predecessors, (130), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 129 [2021-05-06 00:50:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:17,819 INFO L225 Difference]: With dead ends: 2227 [2021-05-06 00:50:17,819 INFO L226 Difference]: Without dead ends: 1324 [2021-05-06 00:50:17,834 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 768.4ms TimeCoverageRelationStatistics Valid=1159, Invalid=3001, Unknown=0, NotChecked=0, Total=4160 [2021-05-06 00:50:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2021-05-06 00:50:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1261. [2021-05-06 00:50:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1211 states have (on average 1.1816680429397193) internal successors, (1431), 1219 states have internal predecessors, (1431), 27 states have call successors, (27), 23 states have call predecessors, (27), 22 states have return successors, (26), 18 states have call predecessors, (26), 26 states have call successors, (26) [2021-05-06 00:50:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1484 transitions. [2021-05-06 00:50:17,869 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1484 transitions. Word has length 129 [2021-05-06 00:50:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:17,869 INFO L480 AbstractCegarLoop]: Abstraction has 1261 states and 1484 transitions. [2021-05-06 00:50:17,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 3.3333333333333335) internal successors, (130), 38 states have internal predecessors, (130), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1484 transitions. [2021-05-06 00:50:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-06 00:50:17,871 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:17,871 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:18,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:18,088 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:18,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:18,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2073554825, now seen corresponding path program 2 times [2021-05-06 00:50:18,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:18,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384562973] [2021-05-06 00:50:18,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:18,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:18,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:18,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-06 00:50:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 906 proven. 425 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2021-05-06 00:50:18,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:18,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384562973] [2021-05-06 00:50:18,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384562973] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:18,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795456761] [2021-05-06 00:50:18,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:18,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 00:50:18,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:18,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-06 00:50:18,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:18,431 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,432 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,443 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,444 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,456 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,470 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,484 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,485 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,499 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,515 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,516 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,532 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,549 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,568 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,639 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,640 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,661 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,683 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,714 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,715 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,835 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,850 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 7 proven. 1293 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2021-05-06 00:50:18,857 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795456761] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:18,857 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:18,857 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2021-05-06 00:50:18,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587694039] [2021-05-06 00:50:18,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-06 00:50:18,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:18,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-06 00:50:18,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=1179, Unknown=0, NotChecked=0, Total=1722 [2021-05-06 00:50:18,859 INFO L87 Difference]: Start difference. First operand 1261 states and 1484 transitions. Second operand has 42 states, 42 states have (on average 3.5) internal successors, (147), 41 states have internal predecessors, (147), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-06 00:50:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:19,464 INFO L93 Difference]: Finished difference Result 2037 states and 2429 transitions. [2021-05-06 00:50:19,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-06 00:50:19,465 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.5) internal successors, (147), 41 states have internal predecessors, (147), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 135 [2021-05-06 00:50:19,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:19,468 INFO L225 Difference]: With dead ends: 2037 [2021-05-06 00:50:19,468 INFO L226 Difference]: Without dead ends: 1584 [2021-05-06 00:50:19,470 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 694.9ms TimeCoverageRelationStatistics Valid=1088, Invalid=2694, Unknown=0, NotChecked=0, Total=3782 [2021-05-06 00:50:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2021-05-06 00:50:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1274. [2021-05-06 00:50:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1224 states have (on average 1.1854575163398693) internal successors, (1451), 1232 states have internal predecessors, (1451), 27 states have call successors, (27), 23 states have call predecessors, (27), 22 states have return successors, (26), 18 states have call predecessors, (26), 26 states have call successors, (26) [2021-05-06 00:50:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1504 transitions. [2021-05-06 00:50:19,507 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1504 transitions. Word has length 135 [2021-05-06 00:50:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:19,508 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 1504 transitions. [2021-05-06 00:50:19,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 3.5) internal successors, (147), 41 states have internal predecessors, (147), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-06 00:50:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1504 transitions. [2021-05-06 00:50:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-05-06 00:50:19,509 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:19,509 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 34, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:19,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-05-06 00:50:19,723 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:19,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:19,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2006144352, now seen corresponding path program 1 times [2021-05-06 00:50:19,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:19,723 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877964324] [2021-05-06 00:50:19,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:19,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:19,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:19,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-06 00:50:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 957 proven. 425 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2021-05-06 00:50:19,936 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:19,936 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877964324] [2021-05-06 00:50:19,936 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877964324] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:19,936 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388559197] [2021-05-06 00:50:19,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:19,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 20 conjunts are in the unsatisfiable core [2021-05-06 00:50:19,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:20,023 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,023 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,047 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,048 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,059 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,060 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,073 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,091 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,092 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,108 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,149 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,189 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,190 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,209 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,228 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,229 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,254 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,273 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,274 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,343 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,347 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,375 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 955 proven. 425 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2021-05-06 00:50:20,445 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388559197] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:20,445 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:20,445 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2021-05-06 00:50:20,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512431817] [2021-05-06 00:50:20,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-06 00:50:20,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:20,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-06 00:50:20,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=970, Unknown=0, NotChecked=0, Total=1560 [2021-05-06 00:50:20,446 INFO L87 Difference]: Start difference. First operand 1274 states and 1504 transitions. Second operand has 40 states, 40 states have (on average 3.425) internal successors, (137), 39 states have internal predecessors, (137), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:20,822 INFO L93 Difference]: Finished difference Result 2394 states and 2831 transitions. [2021-05-06 00:50:20,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-06 00:50:20,822 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.425) internal successors, (137), 39 states have internal predecessors, (137), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 138 [2021-05-06 00:50:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:20,825 INFO L225 Difference]: With dead ends: 2394 [2021-05-06 00:50:20,825 INFO L226 Difference]: Without dead ends: 1377 [2021-05-06 00:50:20,827 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 431.4ms TimeCoverageRelationStatistics Valid=594, Invalid=1046, Unknown=0, NotChecked=0, Total=1640 [2021-05-06 00:50:20,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2021-05-06 00:50:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1324. [2021-05-06 00:50:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1274 states have (on average 1.1797488226059654) internal successors, (1503), 1282 states have internal predecessors, (1503), 27 states have call successors, (27), 23 states have call predecessors, (27), 22 states have return successors, (26), 18 states have call predecessors, (26), 26 states have call successors, (26) [2021-05-06 00:50:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1556 transitions. [2021-05-06 00:50:20,862 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1556 transitions. Word has length 138 [2021-05-06 00:50:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:20,862 INFO L480 AbstractCegarLoop]: Abstraction has 1324 states and 1556 transitions. [2021-05-06 00:50:20,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 3.425) internal successors, (137), 39 states have internal predecessors, (137), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1556 transitions. [2021-05-06 00:50:20,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-05-06 00:50:20,864 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:20,864 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:21,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:21,077 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:21,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2043274909, now seen corresponding path program 3 times [2021-05-06 00:50:21,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:21,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831518566] [2021-05-06 00:50:21,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:21,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:21,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:21,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-05-06 00:50:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 1013 proven. 477 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2021-05-06 00:50:21,294 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:21,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831518566] [2021-05-06 00:50:21,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831518566] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:21,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557019932] [2021-05-06 00:50:21,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:21,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-05-06 00:50:21,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:21,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 23 conjunts are in the unsatisfiable core [2021-05-06 00:50:21,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:21,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:21,454 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:21,488 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:21,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:21,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:21,659 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:21,661 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:21,681 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 1 proven. 1016 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2021-05-06 00:50:21,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557019932] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:21,703 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:21,703 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11] total 33 [2021-05-06 00:50:21,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105431410] [2021-05-06 00:50:21,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-06 00:50:21,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-06 00:50:21,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2021-05-06 00:50:21,704 INFO L87 Difference]: Start difference. First operand 1324 states and 1556 transitions. Second operand has 33 states, 33 states have (on average 3.303030303030303) internal successors, (109), 31 states have internal predecessors, (109), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-06 00:50:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:24,907 INFO L93 Difference]: Finished difference Result 2207 states and 2619 transitions. [2021-05-06 00:50:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2021-05-06 00:50:24,908 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.303030303030303) internal successors, (109), 31 states have internal predecessors, (109), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 141 [2021-05-06 00:50:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:24,915 INFO L225 Difference]: With dead ends: 2207 [2021-05-06 00:50:24,915 INFO L226 Difference]: Without dead ends: 1730 [2021-05-06 00:50:24,917 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6348 ImplicationChecksByTransitivity, 2774.1ms TimeCoverageRelationStatistics Valid=3364, Invalid=16376, Unknown=0, NotChecked=0, Total=19740 [2021-05-06 00:50:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2021-05-06 00:50:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1405. [2021-05-06 00:50:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1353 states have (on average 1.1759053954175906) internal successors, (1591), 1361 states have internal predecessors, (1591), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (27), 19 states have call predecessors, (27), 27 states have call successors, (27) [2021-05-06 00:50:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1646 transitions. [2021-05-06 00:50:24,975 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1646 transitions. Word has length 141 [2021-05-06 00:50:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:24,975 INFO L480 AbstractCegarLoop]: Abstraction has 1405 states and 1646 transitions. [2021-05-06 00:50:24,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 3.303030303030303) internal successors, (109), 31 states have internal predecessors, (109), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-06 00:50:24,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1646 transitions. [2021-05-06 00:50:24,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-05-06 00:50:24,978 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:24,978 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 36, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:25,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-05-06 00:50:25,185 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:25,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:25,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1583590152, now seen corresponding path program 2 times [2021-05-06 00:50:25,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:25,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353961363] [2021-05-06 00:50:25,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:25,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:25,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:25,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-05-06 00:50:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1067 proven. 477 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2021-05-06 00:50:25,502 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:25,502 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353961363] [2021-05-06 00:50:25,502 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353961363] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:25,502 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131182025] [2021-05-06 00:50:25,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:25,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 00:50:25,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:25,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-06 00:50:25,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:25,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,625 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,639 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,640 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,673 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,696 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,726 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,758 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,775 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,776 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,796 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,797 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,815 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,836 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,857 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,878 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,900 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,952 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:25,974 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1065 proven. 477 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2021-05-06 00:50:26,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131182025] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:26,085 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:26,085 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2021-05-06 00:50:26,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819385636] [2021-05-06 00:50:26,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-06 00:50:26,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:26,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-06 00:50:26,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1071, Unknown=0, NotChecked=0, Total=1722 [2021-05-06 00:50:26,086 INFO L87 Difference]: Start difference. First operand 1405 states and 1646 transitions. Second operand has 42 states, 42 states have (on average 3.4047619047619047) internal successors, (143), 41 states have internal predecessors, (143), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:26,380 INFO L93 Difference]: Finished difference Result 2578 states and 3034 transitions. [2021-05-06 00:50:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-06 00:50:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.4047619047619047) internal successors, (143), 41 states have internal predecessors, (143), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 144 [2021-05-06 00:50:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:26,384 INFO L225 Difference]: With dead ends: 2578 [2021-05-06 00:50:26,384 INFO L226 Difference]: Without dead ends: 1513 [2021-05-06 00:50:26,386 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 505.8ms TimeCoverageRelationStatistics Valid=655, Invalid=1151, Unknown=0, NotChecked=0, Total=1806 [2021-05-06 00:50:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2021-05-06 00:50:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1457. [2021-05-06 00:50:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1405 states have (on average 1.1708185053380782) internal successors, (1645), 1413 states have internal predecessors, (1645), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (27), 19 states have call predecessors, (27), 27 states have call successors, (27) [2021-05-06 00:50:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1700 transitions. [2021-05-06 00:50:26,428 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1700 transitions. Word has length 144 [2021-05-06 00:50:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:26,428 INFO L480 AbstractCegarLoop]: Abstraction has 1457 states and 1700 transitions. [2021-05-06 00:50:26,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 3.4047619047619047) internal successors, (143), 41 states have internal predecessors, (143), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1700 transitions. [2021-05-06 00:50:26,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-05-06 00:50:26,429 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:26,430 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 37, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:26,630 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-05-06 00:50:26,630 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:26,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1551920265, now seen corresponding path program 5 times [2021-05-06 00:50:26,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:26,631 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306173987] [2021-05-06 00:50:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:26,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:26,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:26,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-05-06 00:50:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2194 backedges. 1126 proven. 532 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2021-05-06 00:50:26,965 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:26,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306173987] [2021-05-06 00:50:26,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306173987] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:26,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135460409] [2021-05-06 00:50:26,965 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:27,026 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2021-05-06 00:50:27,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:27,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 22 conjunts are in the unsatisfiable core [2021-05-06 00:50:27,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:27,059 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,060 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,083 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,098 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,114 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,128 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,129 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,143 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,144 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,163 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,164 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,199 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,200 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,226 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,245 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,246 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,274 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,295 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,345 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,405 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,428 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,429 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,454 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,477 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,478 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,502 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,503 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,527 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2194 backedges. 1123 proven. 532 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2021-05-06 00:50:27,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135460409] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:27,599 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:27,599 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 45 [2021-05-06 00:50:27,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568973880] [2021-05-06 00:50:27,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-06 00:50:27,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:27,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-06 00:50:27,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=1302, Unknown=0, NotChecked=0, Total=1980 [2021-05-06 00:50:27,600 INFO L87 Difference]: Start difference. First operand 1457 states and 1700 transitions. Second operand has 45 states, 45 states have (on average 3.2888888888888888) internal successors, (148), 44 states have internal predecessors, (148), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:28,422 INFO L93 Difference]: Finished difference Result 3024 states and 3572 transitions. [2021-05-06 00:50:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-06 00:50:28,423 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.2888888888888888) internal successors, (148), 44 states have internal predecessors, (148), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 147 [2021-05-06 00:50:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:28,427 INFO L225 Difference]: With dead ends: 3024 [2021-05-06 00:50:28,427 INFO L226 Difference]: Without dead ends: 1769 [2021-05-06 00:50:28,429 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 1008.1ms TimeCoverageRelationStatistics Valid=1531, Invalid=3871, Unknown=0, NotChecked=0, Total=5402 [2021-05-06 00:50:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2021-05-06 00:50:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1523. [2021-05-06 00:50:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1471 states have (on average 1.1692726036709722) internal successors, (1720), 1479 states have internal predecessors, (1720), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (27), 19 states have call predecessors, (27), 27 states have call successors, (27) [2021-05-06 00:50:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1775 transitions. [2021-05-06 00:50:28,473 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1775 transitions. Word has length 147 [2021-05-06 00:50:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:28,473 INFO L480 AbstractCegarLoop]: Abstraction has 1523 states and 1775 transitions. [2021-05-06 00:50:28,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 3.2888888888888888) internal successors, (148), 44 states have internal predecessors, (148), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 00:50:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1775 transitions. [2021-05-06 00:50:28,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-06 00:50:28,474 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:28,474 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 39, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:28,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-05-06 00:50:28,685 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash -233569437, now seen corresponding path program 6 times [2021-05-06 00:50:28,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:28,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942699451] [2021-05-06 00:50:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:29,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:29,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:29,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:50:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 644 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:50:29,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:29,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942699451] [2021-05-06 00:50:29,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942699451] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:29,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850304854] [2021-05-06 00:50:29,313 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:29,356 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-05-06 00:50:29,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:29,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-06 00:50:29,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:29,552 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:29,553 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:29,582 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:29,614 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 1287 proven. 0 refuted. 0 times theorem prover too weak. 1142 trivial. 0 not checked. [2021-05-06 00:50:29,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850304854] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 00:50:29,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-06 00:50:29,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [44] total 48 [2021-05-06 00:50:29,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540472169] [2021-05-06 00:50:29,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 00:50:29,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:29,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 00:50:29,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1777, Unknown=0, NotChecked=0, Total=2256 [2021-05-06 00:50:29,635 INFO L87 Difference]: Start difference. First operand 1523 states and 1775 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-05-06 00:50:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:29,727 INFO L93 Difference]: Finished difference Result 2206 states and 2553 transitions. [2021-05-06 00:50:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 00:50:29,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2021-05-06 00:50:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:29,730 INFO L225 Difference]: With dead ends: 2206 [2021-05-06 00:50:29,730 INFO L226 Difference]: Without dead ends: 1237 [2021-05-06 00:50:29,731 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 675.9ms TimeCoverageRelationStatistics Valid=491, Invalid=1959, Unknown=0, NotChecked=0, Total=2450 [2021-05-06 00:50:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2021-05-06 00:50:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 998. [2021-05-06 00:50:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 962 states have (on average 1.1496881496881497) internal successors, (1106), 967 states have internal predecessors, (1106), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) [2021-05-06 00:50:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1141 transitions. [2021-05-06 00:50:29,771 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1141 transitions. Word has length 153 [2021-05-06 00:50:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:29,771 INFO L480 AbstractCegarLoop]: Abstraction has 998 states and 1141 transitions. [2021-05-06 00:50:29,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-05-06 00:50:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1141 transitions. [2021-05-06 00:50:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-06 00:50:29,772 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:29,772 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 38, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:29,988 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-05-06 00:50:29,988 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:29,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:29,988 INFO L82 PathProgramCache]: Analyzing trace with hash 114952357, now seen corresponding path program 7 times [2021-05-06 00:50:29,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:29,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682747959] [2021-05-06 00:50:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:30,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:30,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:30,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:50:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 1338 proven. 2 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2021-05-06 00:50:30,094 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:30,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682747959] [2021-05-06 00:50:30,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682747959] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:30,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634706074] [2021-05-06 00:50:30,094 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:30,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 89 conjunts are in the unsatisfiable core [2021-05-06 00:50:30,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 66 proven. 2363 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 00:50:31,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634706074] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:31,176 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:31,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 46] total 51 [2021-05-06 00:50:31,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350229335] [2021-05-06 00:50:31,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-06 00:50:31,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:31,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-06 00:50:31,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2407, Unknown=0, NotChecked=0, Total=2550 [2021-05-06 00:50:31,177 INFO L87 Difference]: Start difference. First operand 998 states and 1141 transitions. Second operand has 51 states, 51 states have (on average 3.2745098039215685) internal successors, (167), 50 states have internal predecessors, (167), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-06 00:50:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:37,615 INFO L93 Difference]: Finished difference Result 2032 states and 2293 transitions. [2021-05-06 00:50:37,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2021-05-06 00:50:37,616 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.2745098039215685) internal successors, (167), 50 states have internal predecessors, (167), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 153 [2021-05-06 00:50:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:37,619 INFO L225 Difference]: With dead ends: 2032 [2021-05-06 00:50:37,619 INFO L226 Difference]: Without dead ends: 1516 [2021-05-06 00:50:37,622 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10367 ImplicationChecksByTransitivity, 2938.9ms TimeCoverageRelationStatistics Valid=1110, Invalid=29340, Unknown=0, NotChecked=0, Total=30450 [2021-05-06 00:50:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2021-05-06 00:50:37,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1174. [2021-05-06 00:50:37,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1132 states have (on average 1.1298586572438163) internal successors, (1279), 1138 states have internal predecessors, (1279), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 14 states have call predecessors, (20), 20 states have call successors, (20) [2021-05-06 00:50:37,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1320 transitions. [2021-05-06 00:50:37,671 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1320 transitions. Word has length 153 [2021-05-06 00:50:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:37,672 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 1320 transitions. [2021-05-06 00:50:37,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 51 states have (on average 3.2745098039215685) internal successors, (167), 50 states have internal predecessors, (167), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-06 00:50:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1320 transitions. [2021-05-06 00:50:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-05-06 00:50:37,674 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:37,674 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 57, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:37,888 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-05-06 00:50:37,889 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:37,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1797369414, now seen corresponding path program 4 times [2021-05-06 00:50:37,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:37,889 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603793741] [2021-05-06 00:50:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:38,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:38,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:38,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:50:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:38,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:50:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 65 proven. 4265 refuted. 0 times theorem prover too weak. 1189 trivial. 0 not checked. [2021-05-06 00:50:38,381 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:38,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603793741] [2021-05-06 00:50:38,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603793741] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:38,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027780509] [2021-05-06 00:50:38,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:38,466 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-06 00:50:38,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:38,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 62 conjunts are in the unsatisfiable core [2021-05-06 00:50:38,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:38,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,549 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,574 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,575 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,631 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,659 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,686 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,718 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,754 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,755 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,786 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,787 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,815 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,845 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,846 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,876 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,916 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,917 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,949 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,950 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,984 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:38,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,056 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,061 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,111 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,112 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,334 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,335 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,361 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,362 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,389 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,390 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,425 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,455 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,486 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,518 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,519 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,549 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,583 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,584 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,623 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,661 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,662 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,700 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,753 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,755 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,820 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,857 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,861 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,906 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,907 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,950 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:39,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:40,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:40,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:40,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:40,081 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:40,205 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:40,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:40,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:40,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:40,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:40,222 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:40,248 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 532 proven. 4393 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2021-05-06 00:50:40,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027780509] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:40,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:40,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 52] total 78 [2021-05-06 00:50:40,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112349855] [2021-05-06 00:50:40,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-06 00:50:40,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:40,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-06 00:50:40,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1099, Invalid=4907, Unknown=0, NotChecked=0, Total=6006 [2021-05-06 00:50:40,277 INFO L87 Difference]: Start difference. First operand 1174 states and 1320 transitions. Second operand has 78 states, 78 states have (on average 3.128205128205128) internal successors, (244), 75 states have internal predecessors, (244), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-05-06 00:50:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:43,667 INFO L93 Difference]: Finished difference Result 1599 states and 1810 transitions. [2021-05-06 00:50:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2021-05-06 00:50:43,667 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 3.128205128205128) internal successors, (244), 75 states have internal predecessors, (244), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 224 [2021-05-06 00:50:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:43,668 INFO L225 Difference]: With dead ends: 1599 [2021-05-06 00:50:43,668 INFO L226 Difference]: Without dead ends: 373 [2021-05-06 00:50:43,670 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8244 ImplicationChecksByTransitivity, 3717.5ms TimeCoverageRelationStatistics Valid=3675, Invalid=19277, Unknown=0, NotChecked=0, Total=22952 [2021-05-06 00:50:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-05-06 00:50:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 293. [2021-05-06 00:50:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 281 states have (on average 1.0249110320284698) internal successors, (288), 281 states have internal predecessors, (288), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-06 00:50:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 299 transitions. [2021-05-06 00:50:43,678 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 299 transitions. Word has length 224 [2021-05-06 00:50:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:43,679 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 299 transitions. [2021-05-06 00:50:43,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 78 states have (on average 3.128205128205128) internal successors, (244), 75 states have internal predecessors, (244), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-05-06 00:50:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 299 transitions. [2021-05-06 00:50:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-05-06 00:50:43,680 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:43,680 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 60, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:43,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:43,893 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:43,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:43,893 INFO L82 PathProgramCache]: Analyzing trace with hash -278770500, now seen corresponding path program 2 times [2021-05-06 00:50:43,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:43,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676316838] [2021-05-06 00:50:43,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:43,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:43,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:43,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:50:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:43,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:50:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 6 proven. 3739 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2021-05-06 00:50:43,996 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:43,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676316838] [2021-05-06 00:50:43,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676316838] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:43,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626492734] [2021-05-06 00:50:43,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:44,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 00:50:44,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:44,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-06 00:50:44,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:44,172 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:44,173 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:44,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:44,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:44,263 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:44,265 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:44,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:44,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:44,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:44,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:44,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 6 proven. 3739 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2021-05-06 00:50:44,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626492734] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:44,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:44,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-05-06 00:50:44,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503421624] [2021-05-06 00:50:44,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-06 00:50:44,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:44,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-06 00:50:44,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-05-06 00:50:44,372 INFO L87 Difference]: Start difference. First operand 293 states and 299 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2021-05-06 00:50:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:44,503 INFO L93 Difference]: Finished difference Result 499 states and 512 transitions. [2021-05-06 00:50:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 00:50:44,503 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 224 [2021-05-06 00:50:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:44,505 INFO L225 Difference]: With dead ends: 499 [2021-05-06 00:50:44,505 INFO L226 Difference]: Without dead ends: 426 [2021-05-06 00:50:44,505 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 92.7ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-05-06 00:50:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-05-06 00:50:44,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 360. [2021-05-06 00:50:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 347 states have (on average 1.0230547550432276) internal successors, (355), 347 states have internal predecessors, (355), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-06 00:50:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 368 transitions. [2021-05-06 00:50:44,514 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 368 transitions. Word has length 224 [2021-05-06 00:50:44,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:44,514 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 368 transitions. [2021-05-06 00:50:44,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2021-05-06 00:50:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 368 transitions. [2021-05-06 00:50:44,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2021-05-06 00:50:44,515 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:44,515 INFO L523 BasicCegarLoop]: trace histogram [80, 80, 80, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:44,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:44,716 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash 145611393, now seen corresponding path program 3 times [2021-05-06 00:50:44,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:44,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62317458] [2021-05-06 00:50:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:44,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:44,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:44,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:50:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:44,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:50:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:44,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:50:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9860 backedges. 9 proven. 7479 refuted. 0 times theorem prover too weak. 2372 trivial. 0 not checked. [2021-05-06 00:50:44,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:44,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62317458] [2021-05-06 00:50:44,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62317458] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:44,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789102836] [2021-05-06 00:50:44,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:45,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2021-05-06 00:50:45,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:45,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-06 00:50:45,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:45,121 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,122 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,132 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,223 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,224 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,318 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,399 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,400 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,411 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9860 backedges. 9 proven. 7479 refuted. 0 times theorem prover too weak. 2372 trivial. 0 not checked. [2021-05-06 00:50:45,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789102836] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:45,416 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:45,416 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-05-06 00:50:45,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237966197] [2021-05-06 00:50:45,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-06 00:50:45,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:45,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-06 00:50:45,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-05-06 00:50:45,417 INFO L87 Difference]: Start difference. First operand 360 states and 368 transitions. Second operand has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 13 states have internal predecessors, (93), 9 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2021-05-06 00:50:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:45,559 INFO L93 Difference]: Finished difference Result 566 states and 581 transitions. [2021-05-06 00:50:45,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 00:50:45,559 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 13 states have internal predecessors, (93), 9 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 295 [2021-05-06 00:50:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:45,560 INFO L225 Difference]: With dead ends: 566 [2021-05-06 00:50:45,560 INFO L226 Difference]: Without dead ends: 493 [2021-05-06 00:50:45,561 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 94.0ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-05-06 00:50:45,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-05-06 00:50:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 427. [2021-05-06 00:50:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 413 states have (on average 1.0217917675544794) internal successors, (422), 413 states have internal predecessors, (422), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-06 00:50:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 437 transitions. [2021-05-06 00:50:45,573 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 437 transitions. Word has length 295 [2021-05-06 00:50:45,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:45,573 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 437 transitions. [2021-05-06 00:50:45,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 13 states have internal predecessors, (93), 9 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2021-05-06 00:50:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 437 transitions. [2021-05-06 00:50:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2021-05-06 00:50:45,575 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:45,575 INFO L523 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:45,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-05-06 00:50:45,789 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:45,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:45,789 INFO L82 PathProgramCache]: Analyzing trace with hash 907992348, now seen corresponding path program 4 times [2021-05-06 00:50:45,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:45,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57337672] [2021-05-06 00:50:45,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:45,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:45,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:45,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:50:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:45,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:50:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:45,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:50:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:45,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:50:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15452 backedges. 12 proven. 12466 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2021-05-06 00:50:45,916 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:45,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57337672] [2021-05-06 00:50:45,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57337672] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:45,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990009901] [2021-05-06 00:50:45,916 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:46,054 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-06 00:50:46,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:46,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 28 conjunts are in the unsatisfiable core [2021-05-06 00:50:46,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:46,090 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,091 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,103 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,117 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,118 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,144 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,145 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,158 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,159 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,173 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,174 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,188 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,189 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,206 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,207 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,223 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,224 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,241 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,242 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,284 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,285 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,305 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,327 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,328 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,350 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,353 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,376 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,377 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,400 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,427 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,428 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,498 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,499 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,608 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,609 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,772 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,865 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,865 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,883 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,972 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15452 backedges. 544 proven. 12524 refuted. 0 times theorem prover too weak. 2384 trivial. 0 not checked. [2021-05-06 00:50:46,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990009901] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:46,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:46,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 30] total 37 [2021-05-06 00:50:46,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16438400] [2021-05-06 00:50:46,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-06 00:50:46,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:46,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-06 00:50:46,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=986, Unknown=0, NotChecked=0, Total=1332 [2021-05-06 00:50:46,997 INFO L87 Difference]: Start difference. First operand 427 states and 437 transitions. Second operand has 37 states, 37 states have (on average 4.513513513513513) internal successors, (167), 36 states have internal predecessors, (167), 11 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-05-06 00:50:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:47,523 INFO L93 Difference]: Finished difference Result 633 states and 650 transitions. [2021-05-06 00:50:47,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-06 00:50:47,523 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.513513513513513) internal successors, (167), 36 states have internal predecessors, (167), 11 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 366 [2021-05-06 00:50:47,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:47,525 INFO L225 Difference]: With dead ends: 633 [2021-05-06 00:50:47,525 INFO L226 Difference]: Without dead ends: 560 [2021-05-06 00:50:47,525 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 343 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 750.6ms TimeCoverageRelationStatistics Valid=1070, Invalid=2236, Unknown=0, NotChecked=0, Total=3306 [2021-05-06 00:50:47,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-05-06 00:50:47,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 494. [2021-05-06 00:50:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 479 states have (on average 1.0208768267223383) internal successors, (489), 479 states have internal predecessors, (489), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 00:50:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 506 transitions. [2021-05-06 00:50:47,546 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 506 transitions. Word has length 366 [2021-05-06 00:50:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:47,547 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 506 transitions. [2021-05-06 00:50:47,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 4.513513513513513) internal successors, (167), 36 states have internal predecessors, (167), 11 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-05-06 00:50:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 506 transitions. [2021-05-06 00:50:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2021-05-06 00:50:47,548 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:47,548 INFO L523 BasicCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:47,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:47,749 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1204609503, now seen corresponding path program 5 times [2021-05-06 00:50:47,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:47,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797743831] [2021-05-06 00:50:47,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:47,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:47,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:47,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:50:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:47,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:50:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:47,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:50:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:47,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:50:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:47,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:50:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 15 proven. 18700 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2021-05-06 00:50:47,889 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:47,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797743831] [2021-05-06 00:50:47,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797743831] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:47,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708686964] [2021-05-06 00:50:47,890 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:48,115 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2021-05-06 00:50:48,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:48,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 31 conjunts are in the unsatisfiable core [2021-05-06 00:50:48,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:48,195 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,196 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,234 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,235 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,247 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,247 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,290 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,304 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,305 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,320 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,321 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,348 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,366 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,385 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,386 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,405 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,406 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,429 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,430 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,472 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,473 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,494 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,503 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,549 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,573 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,574 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,655 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,675 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,696 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,802 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,803 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,822 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,823 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,918 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,919 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:48,941 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:49,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:49,038 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:49,059 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:49,060 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:49,153 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:49,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:49,180 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 601 proven. 18720 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2021-05-06 00:50:49,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708686964] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:49,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:49,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 32] total 40 [2021-05-06 00:50:49,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057160946] [2021-05-06 00:50:49,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-06 00:50:49,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:49,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-06 00:50:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1165, Unknown=0, NotChecked=0, Total=1560 [2021-05-06 00:50:49,187 INFO L87 Difference]: Start difference. First operand 494 states and 506 transitions. Second operand has 40 states, 40 states have (on average 4.625) internal successors, (185), 39 states have internal predecessors, (185), 13 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2021-05-06 00:50:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:50,145 INFO L93 Difference]: Finished difference Result 700 states and 719 transitions. [2021-05-06 00:50:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-06 00:50:50,146 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.625) internal successors, (185), 39 states have internal predecessors, (185), 13 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 437 [2021-05-06 00:50:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:50,147 INFO L225 Difference]: With dead ends: 700 [2021-05-06 00:50:50,147 INFO L226 Difference]: Without dead ends: 627 [2021-05-06 00:50:50,148 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 414 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 1078.4ms TimeCoverageRelationStatistics Valid=2188, Invalid=4454, Unknown=0, NotChecked=0, Total=6642 [2021-05-06 00:50:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2021-05-06 00:50:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 561. [2021-05-06 00:50:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 545 states have (on average 1.0201834862385322) internal successors, (556), 545 states have internal predecessors, (556), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-05-06 00:50:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 575 transitions. [2021-05-06 00:50:50,169 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 575 transitions. Word has length 437 [2021-05-06 00:50:50,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:50,169 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 575 transitions. [2021-05-06 00:50:50,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 4.625) internal successors, (185), 39 states have internal predecessors, (185), 13 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2021-05-06 00:50:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 575 transitions. [2021-05-06 00:50:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2021-05-06 00:50:50,171 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:50,171 INFO L523 BasicCegarLoop]: trace histogram [140, 140, 140, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:50,390 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-05-06 00:50:50,390 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:50,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:50,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1694415492, now seen corresponding path program 6 times [2021-05-06 00:50:50,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:50,390 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087887629] [2021-05-06 00:50:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:50,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:50,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:50,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:50:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:50,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:50:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:50,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:50:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:50,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:50:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:50,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:50:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:50,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:50:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 30389 backedges. 18 proven. 26181 refuted. 0 times theorem prover too weak. 4190 trivial. 0 not checked. [2021-05-06 00:50:50,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:50,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087887629] [2021-05-06 00:50:50,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087887629] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:50,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865555798] [2021-05-06 00:50:50,582 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:50,823 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2021-05-06 00:50:50,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:50,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 10 conjunts are in the unsatisfiable core [2021-05-06 00:50:50,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:50,923 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:50,923 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:50,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:50,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,038 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,117 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,209 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,209 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,221 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,222 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,305 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,404 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,416 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,494 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 30389 backedges. 18 proven. 26181 refuted. 0 times theorem prover too weak. 4190 trivial. 0 not checked. [2021-05-06 00:50:51,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865555798] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:51,512 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:51,512 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-05-06 00:50:51,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851469544] [2021-05-06 00:50:51,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-06 00:50:51,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:51,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-06 00:50:51,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2021-05-06 00:50:51,513 INFO L87 Difference]: Start difference. First operand 561 states and 575 transitions. Second operand has 20 states, 20 states have (on average 7.35) internal successors, (147), 19 states have internal predecessors, (147), 15 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2021-05-06 00:50:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:51,710 INFO L93 Difference]: Finished difference Result 767 states and 788 transitions. [2021-05-06 00:50:51,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-06 00:50:51,710 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.35) internal successors, (147), 19 states have internal predecessors, (147), 15 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 508 [2021-05-06 00:50:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:51,712 INFO L225 Difference]: With dead ends: 767 [2021-05-06 00:50:51,712 INFO L226 Difference]: Without dead ends: 694 [2021-05-06 00:50:51,712 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 167.2ms TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2021-05-06 00:50:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2021-05-06 00:50:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 628. [2021-05-06 00:50:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 611 states have (on average 1.0196399345335516) internal successors, (623), 611 states have internal predecessors, (623), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-05-06 00:50:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 644 transitions. [2021-05-06 00:50:51,731 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 644 transitions. Word has length 508 [2021-05-06 00:50:51,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:51,732 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 644 transitions. [2021-05-06 00:50:51,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 7.35) internal successors, (147), 19 states have internal predecessors, (147), 15 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2021-05-06 00:50:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 644 transitions. [2021-05-06 00:50:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2021-05-06 00:50:51,734 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:51,734 INFO L523 BasicCegarLoop]: trace histogram [160, 160, 160, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:51,935 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:51,935 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:51,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1232107071, now seen corresponding path program 7 times [2021-05-06 00:50:51,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:51,935 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509809994] [2021-05-06 00:50:51,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:52,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:52,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:52,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:50:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:52,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:50:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:52,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:50:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:52,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:50:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:52,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:50:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:52,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:50:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:52,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 00:50:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 39734 backedges. 21 proven. 34909 refuted. 0 times theorem prover too weak. 4804 trivial. 0 not checked. [2021-05-06 00:50:52,095 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:52,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509809994] [2021-05-06 00:50:52,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509809994] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:52,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503125271] [2021-05-06 00:50:52,095 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:52,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-06 00:50:52,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:52,336 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,441 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,442 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,452 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,529 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,530 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,540 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,541 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,625 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,626 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,637 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,715 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,716 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,727 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,728 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,805 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,805 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,902 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,915 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,916 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,992 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:52,993 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:53,006 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 39734 backedges. 21 proven. 34909 refuted. 0 times theorem prover too weak. 4804 trivial. 0 not checked. [2021-05-06 00:50:53,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503125271] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:53,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:53,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-05-06 00:50:53,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802639410] [2021-05-06 00:50:53,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-06 00:50:53,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:53,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-06 00:50:53,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2021-05-06 00:50:53,013 INFO L87 Difference]: Start difference. First operand 628 states and 644 transitions. Second operand has 22 states, 22 states have (on average 7.5) internal successors, (165), 21 states have internal predecessors, (165), 17 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2021-05-06 00:50:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:53,192 INFO L93 Difference]: Finished difference Result 834 states and 857 transitions. [2021-05-06 00:50:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-06 00:50:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 21 states have internal predecessors, (165), 17 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 579 [2021-05-06 00:50:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:53,194 INFO L225 Difference]: With dead ends: 834 [2021-05-06 00:50:53,194 INFO L226 Difference]: Without dead ends: 761 [2021-05-06 00:50:53,195 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 162.6ms TimeCoverageRelationStatistics Valid=180, Invalid=326, Unknown=0, NotChecked=0, Total=506 [2021-05-06 00:50:53,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2021-05-06 00:50:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 695. [2021-05-06 00:50:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 677 states have (on average 1.0192023633677991) internal successors, (690), 677 states have internal predecessors, (690), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-05-06 00:50:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 713 transitions. [2021-05-06 00:50:53,216 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 713 transitions. Word has length 579 [2021-05-06 00:50:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:53,216 INFO L480 AbstractCegarLoop]: Abstraction has 695 states and 713 transitions. [2021-05-06 00:50:53,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 21 states have internal predecessors, (165), 17 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2021-05-06 00:50:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 713 transitions. [2021-05-06 00:50:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2021-05-06 00:50:53,219 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:53,219 INFO L523 BasicCegarLoop]: trace histogram [180, 180, 180, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:53,420 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-05-06 00:50:53,420 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2056288804, now seen corresponding path program 8 times [2021-05-06 00:50:53,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:53,420 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670179625] [2021-05-06 00:50:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:53,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:53,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:53,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:50:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:53,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:50:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:53,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:50:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:53,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:50:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:53,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:50:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:53,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:50:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:53,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 00:50:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:53,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 00:50:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 50330 backedges. 24 proven. 44884 refuted. 0 times theorem prover too weak. 5422 trivial. 0 not checked. [2021-05-06 00:50:53,608 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:53,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670179625] [2021-05-06 00:50:53,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670179625] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:53,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348564452] [2021-05-06 00:50:53,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:53,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 00:50:53,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:53,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 12 conjunts are in the unsatisfiable core [2021-05-06 00:50:53,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:53,862 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:53,863 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:53,872 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:53,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:53,949 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:53,950 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:53,960 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:53,961 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,038 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,049 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,050 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,148 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,149 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,229 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,230 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,242 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,243 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,321 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,335 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,336 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,445 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,460 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,461 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,538 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,539 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,553 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,554 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,643 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 50330 backedges. 24 proven. 44884 refuted. 0 times theorem prover too weak. 5422 trivial. 0 not checked. [2021-05-06 00:50:54,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348564452] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:54,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:54,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-05-06 00:50:54,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069137265] [2021-05-06 00:50:54,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-06 00:50:54,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:54,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-06 00:50:54,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2021-05-06 00:50:54,666 INFO L87 Difference]: Start difference. First operand 695 states and 713 transitions. Second operand has 24 states, 24 states have (on average 7.625) internal successors, (183), 23 states have internal predecessors, (183), 19 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2021-05-06 00:50:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:54,866 INFO L93 Difference]: Finished difference Result 901 states and 926 transitions. [2021-05-06 00:50:54,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-06 00:50:54,866 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.625) internal successors, (183), 23 states have internal predecessors, (183), 19 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 650 [2021-05-06 00:50:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:54,868 INFO L225 Difference]: With dead ends: 901 [2021-05-06 00:50:54,868 INFO L226 Difference]: Without dead ends: 828 [2021-05-06 00:50:54,869 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 660 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 183.1ms TimeCoverageRelationStatistics Valid=214, Invalid=386, Unknown=0, NotChecked=0, Total=600 [2021-05-06 00:50:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2021-05-06 00:50:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 762. [2021-05-06 00:50:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 743 states have (on average 1.018842530282638) internal successors, (757), 743 states have internal predecessors, (757), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-06 00:50:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 782 transitions. [2021-05-06 00:50:54,893 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 782 transitions. Word has length 650 [2021-05-06 00:50:54,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:54,893 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 782 transitions. [2021-05-06 00:50:54,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 7.625) internal successors, (183), 23 states have internal predecessors, (183), 19 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2021-05-06 00:50:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 782 transitions. [2021-05-06 00:50:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2021-05-06 00:50:54,897 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:54,897 INFO L523 BasicCegarLoop]: trace histogram [200, 200, 200, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:55,113 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-05-06 00:50:55,113 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:55,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:55,114 INFO L82 PathProgramCache]: Analyzing trace with hash -845341343, now seen corresponding path program 9 times [2021-05-06 00:50:55,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:55,114 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052779157] [2021-05-06 00:50:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:55,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:55,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:55,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:50:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:55,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:50:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:55,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:50:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:55,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:50:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:55,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:50:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:55,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:50:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:55,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 00:50:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:55,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 00:50:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:55,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 00:50:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 62177 backedges. 27 proven. 56106 refuted. 0 times theorem prover too weak. 6044 trivial. 0 not checked. [2021-05-06 00:50:55,330 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:55,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052779157] [2021-05-06 00:50:55,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052779157] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:55,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187608536] [2021-05-06 00:50:55,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:55,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2021-05-06 00:50:55,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:55,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-06 00:50:55,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:55,650 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,650 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,733 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,734 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,743 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,744 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,822 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,833 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,835 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,927 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:55,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,112 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,204 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,295 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,298 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,313 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,313 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,396 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,397 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,412 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,495 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,496 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,511 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 62177 backedges. 27 proven. 56106 refuted. 0 times theorem prover too weak. 6044 trivial. 0 not checked. [2021-05-06 00:50:56,518 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187608536] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:56,518 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:56,518 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-06 00:50:56,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117795148] [2021-05-06 00:50:56,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-06 00:50:56,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:56,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-06 00:50:56,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2021-05-06 00:50:56,519 INFO L87 Difference]: Start difference. First operand 762 states and 782 transitions. Second operand has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 25 states have internal predecessors, (201), 21 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2021-05-06 00:50:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:56,781 INFO L93 Difference]: Finished difference Result 968 states and 995 transitions. [2021-05-06 00:50:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-06 00:50:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 25 states have internal predecessors, (201), 21 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 721 [2021-05-06 00:50:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:56,784 INFO L225 Difference]: With dead ends: 968 [2021-05-06 00:50:56,784 INFO L226 Difference]: Without dead ends: 895 [2021-05-06 00:50:56,784 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 207.1ms TimeCoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2021-05-06 00:50:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2021-05-06 00:50:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 829. [2021-05-06 00:50:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 809 states have (on average 1.0185414091470952) internal successors, (824), 809 states have internal predecessors, (824), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-05-06 00:50:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 851 transitions. [2021-05-06 00:50:56,822 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 851 transitions. Word has length 721 [2021-05-06 00:50:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:56,822 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 851 transitions. [2021-05-06 00:50:56,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 25 states have internal predecessors, (201), 21 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2021-05-06 00:50:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 851 transitions. [2021-05-06 00:50:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2021-05-06 00:50:56,826 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:56,827 INFO L523 BasicCegarLoop]: trace histogram [220, 220, 220, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:50:57,027 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-05-06 00:50:57,027 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:50:57,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:50:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash 307207740, now seen corresponding path program 10 times [2021-05-06 00:50:57,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:50:57,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669750249] [2021-05-06 00:50:57,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:50:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:50:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:50:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:50:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:50:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:50:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:50:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:50:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:50:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 00:50:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 00:50:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 00:50:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 00:50:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:50:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 75275 backedges. 30 proven. 68575 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2021-05-06 00:50:57,267 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:50:57,267 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669750249] [2021-05-06 00:50:57,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669750249] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:57,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018947358] [2021-05-06 00:50:57,268 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:50:57,445 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-06 00:50:57,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:50:57,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 34 conjunts are in the unsatisfiable core [2021-05-06 00:50:57,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:50:57,486 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,501 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,515 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,516 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,530 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,551 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,604 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,621 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,639 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,640 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,677 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,678 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,698 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,720 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,721 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,743 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,744 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,767 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,768 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,791 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,792 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,817 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,842 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,843 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,868 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,869 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,893 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,917 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,918 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,935 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:57,936 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,028 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,045 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,046 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,139 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,157 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,158 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,249 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,269 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,270 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,363 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,386 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,387 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,504 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,643 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,739 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,740 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,861 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,862 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:58,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:59,016 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:59,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:59,112 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:59,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:59,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:50:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 75275 backedges. 562 proven. 68633 refuted. 0 times theorem prover too weak. 6080 trivial. 0 not checked. [2021-05-06 00:50:59,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018947358] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:50:59,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:50:59,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 36] total 49 [2021-05-06 00:50:59,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149464942] [2021-05-06 00:50:59,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-06 00:50:59,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:50:59,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-06 00:50:59,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=1811, Unknown=0, NotChecked=0, Total=2352 [2021-05-06 00:50:59,145 INFO L87 Difference]: Start difference. First operand 829 states and 851 transitions. Second operand has 49 states, 49 states have (on average 5.612244897959184) internal successors, (275), 48 states have internal predecessors, (275), 23 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2021-05-06 00:50:59,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:50:59,825 INFO L93 Difference]: Finished difference Result 1035 states and 1064 transitions. [2021-05-06 00:50:59,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-06 00:50:59,826 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.612244897959184) internal successors, (275), 48 states have internal predecessors, (275), 23 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) Word has length 792 [2021-05-06 00:50:59,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:50:59,828 INFO L225 Difference]: With dead ends: 1035 [2021-05-06 00:50:59,828 INFO L226 Difference]: Without dead ends: 962 [2021-05-06 00:50:59,828 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 763 SyntacticMatches, 20 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 1073.6ms TimeCoverageRelationStatistics Valid=1505, Invalid=3325, Unknown=0, NotChecked=0, Total=4830 [2021-05-06 00:50:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-05-06 00:50:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 896. [2021-05-06 00:50:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 875 states have (on average 1.0182857142857142) internal successors, (891), 875 states have internal predecessors, (891), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-05-06 00:50:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 920 transitions. [2021-05-06 00:50:59,860 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 920 transitions. Word has length 792 [2021-05-06 00:50:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:50:59,861 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 920 transitions. [2021-05-06 00:50:59,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 5.612244897959184) internal successors, (275), 48 states have internal predecessors, (275), 23 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2021-05-06 00:50:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 920 transitions. [2021-05-06 00:50:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2021-05-06 00:50:59,865 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:50:59,866 INFO L523 BasicCegarLoop]: trace histogram [240, 240, 240, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:51:00,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:00,081 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:51:00,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:51:00,081 INFO L82 PathProgramCache]: Analyzing trace with hash -508176127, now seen corresponding path program 11 times [2021-05-06 00:51:00,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:51:00,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332711807] [2021-05-06 00:51:00,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:51:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:51:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:51:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:51:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:51:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:51:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:51:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:51:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:51:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 00:51:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 00:51:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 00:51:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 00:51:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 00:51:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 89624 backedges. 33 proven. 82291 refuted. 0 times theorem prover too weak. 7300 trivial. 0 not checked. [2021-05-06 00:51:00,339 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:51:00,339 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332711807] [2021-05-06 00:51:00,340 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332711807] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:00,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864042813] [2021-05-06 00:51:00,340 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:00,933 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 91 check-sat command(s) [2021-05-06 00:51:00,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:51:00,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 37 conjunts are in the unsatisfiable core [2021-05-06 00:51:00,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:51:01,022 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,023 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,033 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,052 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,053 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,066 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,067 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,083 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,118 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,118 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,155 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,174 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,175 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,194 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,195 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,215 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,236 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,260 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,282 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,283 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,395 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,396 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,423 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,452 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,507 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,530 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,551 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,551 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,647 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,665 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,666 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,772 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,773 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,796 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,903 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,905 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,927 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:01,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,030 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,054 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,164 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,282 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,282 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,305 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,305 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,400 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,520 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,641 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,642 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,764 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,765 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 89624 backedges. 643 proven. 82311 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2021-05-06 00:51:02,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864042813] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:02,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:51:02,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 38] total 52 [2021-05-06 00:51:02,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624468181] [2021-05-06 00:51:02,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-06 00:51:02,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:51:02,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-06 00:51:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2044, Unknown=0, NotChecked=0, Total=2652 [2021-05-06 00:51:02,799 INFO L87 Difference]: Start difference. First operand 896 states and 920 transitions. Second operand has 52 states, 52 states have (on average 5.634615384615385) internal successors, (293), 51 states have internal predecessors, (293), 25 states have call successors, (29), 4 states have call predecessors, (29), 2 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2021-05-06 00:51:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:51:03,748 INFO L93 Difference]: Finished difference Result 1102 states and 1133 transitions. [2021-05-06 00:51:03,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-06 00:51:03,748 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.634615384615385) internal successors, (293), 51 states have internal predecessors, (293), 25 states have call successors, (29), 4 states have call predecessors, (29), 2 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) Word has length 863 [2021-05-06 00:51:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:51:03,750 INFO L225 Difference]: With dead ends: 1102 [2021-05-06 00:51:03,750 INFO L226 Difference]: Without dead ends: 1029 [2021-05-06 00:51:03,751 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 946 GetRequests, 834 SyntacticMatches, 20 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2529 ImplicationChecksByTransitivity, 1392.2ms TimeCoverageRelationStatistics Valid=2893, Invalid=5849, Unknown=0, NotChecked=0, Total=8742 [2021-05-06 00:51:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2021-05-06 00:51:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 963. [2021-05-06 00:51:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 941 states have (on average 1.0180658873538788) internal successors, (958), 941 states have internal predecessors, (958), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-06 00:51:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 989 transitions. [2021-05-06 00:51:03,786 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 989 transitions. Word has length 863 [2021-05-06 00:51:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:51:03,786 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 989 transitions. [2021-05-06 00:51:03,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 5.634615384615385) internal successors, (293), 51 states have internal predecessors, (293), 25 states have call successors, (29), 4 states have call predecessors, (29), 2 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2021-05-06 00:51:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 989 transitions. [2021-05-06 00:51:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2021-05-06 00:51:03,792 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:51:03,792 INFO L523 BasicCegarLoop]: trace histogram [260, 260, 260, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:51:04,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:04,005 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:51:04,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:51:04,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1946652316, now seen corresponding path program 12 times [2021-05-06 00:51:04,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:51:04,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611644784] [2021-05-06 00:51:04,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:51:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:51:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:51:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:51:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:51:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:51:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:51:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:51:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:51:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 00:51:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 00:51:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 00:51:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 00:51:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 00:51:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 00:51:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 105224 backedges. 36 proven. 97254 refuted. 0 times theorem prover too weak. 7934 trivial. 0 not checked. [2021-05-06 00:51:04,300 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:51:04,300 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611644784] [2021-05-06 00:51:04,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611644784] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:04,300 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016327442] [2021-05-06 00:51:04,300 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:04,687 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2021-05-06 00:51:04,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:51:04,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 16 conjunts are in the unsatisfiable core [2021-05-06 00:51:04,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:51:04,781 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:04,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:04,792 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:04,793 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:04,869 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:04,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:04,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:04,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:04,966 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:04,967 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:04,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:04,981 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,063 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,064 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,075 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,076 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,152 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,153 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,254 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,268 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,359 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,373 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,374 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,458 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,473 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,473 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,551 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,566 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,661 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,737 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,738 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,757 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,758 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,834 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,835 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,853 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,854 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 105224 backedges. 36 proven. 97254 refuted. 0 times theorem prover too weak. 7934 trivial. 0 not checked. [2021-05-06 00:51:05,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016327442] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:05,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:51:05,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-05-06 00:51:05,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10935273] [2021-05-06 00:51:05,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-06 00:51:05,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:51:05,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-06 00:51:05,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=616, Unknown=0, NotChecked=0, Total=992 [2021-05-06 00:51:05,962 INFO L87 Difference]: Start difference. First operand 963 states and 989 transitions. Second operand has 32 states, 32 states have (on average 7.96875) internal successors, (255), 31 states have internal predecessors, (255), 27 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (27), 25 states have call predecessors, (27), 26 states have call successors, (27) [2021-05-06 00:51:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:51:06,308 INFO L93 Difference]: Finished difference Result 1169 states and 1202 transitions. [2021-05-06 00:51:06,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-06 00:51:06,308 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.96875) internal successors, (255), 31 states have internal predecessors, (255), 27 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (27), 25 states have call predecessors, (27), 26 states have call successors, (27) Word has length 934 [2021-05-06 00:51:06,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:51:06,310 INFO L225 Difference]: With dead ends: 1169 [2021-05-06 00:51:06,310 INFO L226 Difference]: Without dead ends: 1096 [2021-05-06 00:51:06,310 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 948 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 276.9ms TimeCoverageRelationStatistics Valid=380, Invalid=676, Unknown=0, NotChecked=0, Total=1056 [2021-05-06 00:51:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2021-05-06 00:51:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1030. [2021-05-06 00:51:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1007 states have (on average 1.0178748758689176) internal successors, (1025), 1007 states have internal predecessors, (1025), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-06 00:51:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1058 transitions. [2021-05-06 00:51:06,347 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1058 transitions. Word has length 934 [2021-05-06 00:51:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:51:06,348 INFO L480 AbstractCegarLoop]: Abstraction has 1030 states and 1058 transitions. [2021-05-06 00:51:06,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 7.96875) internal successors, (255), 31 states have internal predecessors, (255), 27 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (27), 25 states have call predecessors, (27), 26 states have call successors, (27) [2021-05-06 00:51:06,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1058 transitions. [2021-05-06 00:51:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2021-05-06 00:51:06,354 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:51:06,354 INFO L523 BasicCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:51:06,557 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2021-05-06 00:51:06,557 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:51:06,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:51:06,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1850491743, now seen corresponding path program 13 times [2021-05-06 00:51:06,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:51:06,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361846755] [2021-05-06 00:51:06,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:51:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:51:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:51:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:51:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:51:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:51:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:51:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:51:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:51:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 00:51:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 00:51:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 00:51:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 00:51:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 00:51:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 00:51:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-06 00:51:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2021-05-06 00:51:06,884 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:51:06,884 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361846755] [2021-05-06 00:51:06,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361846755] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:06,884 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800099732] [2021-05-06 00:51:06,885 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:07,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 17 conjunts are in the unsatisfiable core [2021-05-06 00:51:07,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:51:07,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,209 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,317 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,318 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,327 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,328 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,414 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,416 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,492 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,582 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,594 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,595 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,686 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,763 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,777 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,777 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,854 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,855 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,869 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,946 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,947 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,962 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:07,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,040 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,056 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,056 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,236 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,254 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,254 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,426 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,433 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2021-05-06 00:51:08,460 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800099732] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:08,460 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:51:08,460 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2021-05-06 00:51:08,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638219223] [2021-05-06 00:51:08,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-06 00:51:08,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:51:08,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-06 00:51:08,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2021-05-06 00:51:08,462 INFO L87 Difference]: Start difference. First operand 1030 states and 1058 transitions. Second operand has 34 states, 34 states have (on average 8.029411764705882) internal successors, (273), 33 states have internal predecessors, (273), 29 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29) [2021-05-06 00:51:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:51:08,786 INFO L93 Difference]: Finished difference Result 1236 states and 1271 transitions. [2021-05-06 00:51:08,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-06 00:51:08,787 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.029411764705882) internal successors, (273), 33 states have internal predecessors, (273), 29 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29) Word has length 1005 [2021-05-06 00:51:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:51:08,788 INFO L225 Difference]: With dead ends: 1236 [2021-05-06 00:51:08,788 INFO L226 Difference]: Without dead ends: 1163 [2021-05-06 00:51:08,789 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 1020 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 312.5ms TimeCoverageRelationStatistics Valid=429, Invalid=761, Unknown=0, NotChecked=0, Total=1190 [2021-05-06 00:51:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2021-05-06 00:51:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1097. [2021-05-06 00:51:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1073 states have (on average 1.0177073625349486) internal successors, (1092), 1073 states have internal predecessors, (1092), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-05-06 00:51:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1127 transitions. [2021-05-06 00:51:08,830 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1127 transitions. Word has length 1005 [2021-05-06 00:51:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:51:08,831 INFO L480 AbstractCegarLoop]: Abstraction has 1097 states and 1127 transitions. [2021-05-06 00:51:08,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 8.029411764705882) internal successors, (273), 33 states have internal predecessors, (273), 29 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29) [2021-05-06 00:51:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1127 transitions. [2021-05-06 00:51:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2021-05-06 00:51:08,838 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:51:08,838 INFO L523 BasicCegarLoop]: trace histogram [300, 300, 300, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:51:09,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:09,038 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:51:09,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:51:09,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1383945980, now seen corresponding path program 14 times [2021-05-06 00:51:09,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:51:09,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702711909] [2021-05-06 00:51:09,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:51:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:51:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:51:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:51:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:51:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:51:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:51:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:51:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:51:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 00:51:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 00:51:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 00:51:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 00:51:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 00:51:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 00:51:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-06 00:51:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-06 00:51:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 140177 backedges. 42 proven. 130921 refuted. 0 times theorem prover too weak. 9214 trivial. 0 not checked. [2021-05-06 00:51:09,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:51:09,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702711909] [2021-05-06 00:51:09,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702711909] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:09,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479975744] [2021-05-06 00:51:09,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:09,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 00:51:09,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:51:09,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 1705 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-06 00:51:09,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:51:09,749 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:09,750 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:09,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:09,760 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:09,833 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:09,834 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:09,843 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:09,844 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:09,917 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:09,918 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:09,932 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:09,932 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,010 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,033 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,112 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,224 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,240 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,326 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,327 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,341 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,342 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,429 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,430 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,534 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,535 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,551 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,723 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,820 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,914 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,915 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:10,952 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:11,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:11,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:11,056 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:11,056 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:11,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:11,139 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:11,158 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 140177 backedges. 42 proven. 130921 refuted. 0 times theorem prover too weak. 9214 trivial. 0 not checked. [2021-05-06 00:51:11,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479975744] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:11,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:51:11,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2021-05-06 00:51:11,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605729535] [2021-05-06 00:51:11,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-06 00:51:11,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:51:11,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-06 00:51:11,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=783, Unknown=0, NotChecked=0, Total=1260 [2021-05-06 00:51:11,170 INFO L87 Difference]: Start difference. First operand 1097 states and 1127 transitions. Second operand has 36 states, 36 states have (on average 8.083333333333334) internal successors, (291), 35 states have internal predecessors, (291), 31 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (31), 29 states have call predecessors, (31), 30 states have call successors, (31) [2021-05-06 00:51:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:51:11,538 INFO L93 Difference]: Finished difference Result 1303 states and 1340 transitions. [2021-05-06 00:51:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-06 00:51:11,538 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 8.083333333333334) internal successors, (291), 35 states have internal predecessors, (291), 31 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (31), 29 states have call predecessors, (31), 30 states have call successors, (31) Word has length 1076 [2021-05-06 00:51:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:51:11,540 INFO L225 Difference]: With dead ends: 1303 [2021-05-06 00:51:11,540 INFO L226 Difference]: Without dead ends: 1230 [2021-05-06 00:51:11,540 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1092 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 350.3ms TimeCoverageRelationStatistics Valid=481, Invalid=851, Unknown=0, NotChecked=0, Total=1332 [2021-05-06 00:51:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2021-05-06 00:51:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1164. [2021-05-06 00:51:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1139 states have (on average 1.0175592625109746) internal successors, (1159), 1139 states have internal predecessors, (1159), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-06 00:51:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1196 transitions. [2021-05-06 00:51:11,587 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1196 transitions. Word has length 1076 [2021-05-06 00:51:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:51:11,587 INFO L480 AbstractCegarLoop]: Abstraction has 1164 states and 1196 transitions. [2021-05-06 00:51:11,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 8.083333333333334) internal successors, (291), 35 states have internal predecessors, (291), 31 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (31), 29 states have call predecessors, (31), 30 states have call successors, (31) [2021-05-06 00:51:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1196 transitions. [2021-05-06 00:51:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2021-05-06 00:51:11,595 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:51:11,595 INFO L523 BasicCegarLoop]: trace histogram [320, 320, 320, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:51:11,798 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:11,798 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:51:11,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:51:11,798 INFO L82 PathProgramCache]: Analyzing trace with hash -688863167, now seen corresponding path program 15 times [2021-05-06 00:51:11,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:51:11,799 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334405991] [2021-05-06 00:51:11,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:51:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:51:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:51:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:51:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:51:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:51:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:51:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:51:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:51:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 00:51:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 00:51:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 00:51:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 00:51:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 00:51:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 00:51:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-06 00:51:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-06 00:51:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-06 00:51:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 159530 backedges. 45 proven. 149625 refuted. 0 times theorem prover too weak. 9860 trivial. 0 not checked. [2021-05-06 00:51:12,159 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:51:12,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334405991] [2021-05-06 00:51:12,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334405991] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:12,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588266428] [2021-05-06 00:51:12,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:13,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 134 check-sat command(s) [2021-05-06 00:51:13,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:51:13,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 1811 conjuncts, 19 conjunts are in the unsatisfiable core [2021-05-06 00:51:13,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:51:13,119 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,129 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,229 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,230 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,396 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,397 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,415 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,499 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,512 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,513 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,589 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,590 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,604 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,680 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,680 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,694 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,773 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,774 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,788 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,868 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,961 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,962 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:13,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,054 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,150 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,169 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,248 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,249 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,353 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,372 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,373 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,590 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 159530 backedges. 45 proven. 149625 refuted. 0 times theorem prover too weak. 9860 trivial. 0 not checked. [2021-05-06 00:51:14,602 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588266428] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:14,602 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:51:14,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2021-05-06 00:51:14,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916616271] [2021-05-06 00:51:14,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-06 00:51:14,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:51:14,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-06 00:51:14,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=874, Unknown=0, NotChecked=0, Total=1406 [2021-05-06 00:51:14,603 INFO L87 Difference]: Start difference. First operand 1164 states and 1196 transitions. Second operand has 38 states, 38 states have (on average 8.131578947368421) internal successors, (309), 37 states have internal predecessors, (309), 33 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 31 states have call predecessors, (33), 32 states have call successors, (33) [2021-05-06 00:51:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:51:14,976 INFO L93 Difference]: Finished difference Result 1370 states and 1409 transitions. [2021-05-06 00:51:14,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-06 00:51:14,976 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.131578947368421) internal successors, (309), 37 states have internal predecessors, (309), 33 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 31 states have call predecessors, (33), 32 states have call successors, (33) Word has length 1147 [2021-05-06 00:51:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:51:14,978 INFO L225 Difference]: With dead ends: 1370 [2021-05-06 00:51:14,978 INFO L226 Difference]: Without dead ends: 1297 [2021-05-06 00:51:14,979 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1201 GetRequests, 1164 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 367.9ms TimeCoverageRelationStatistics Valid=536, Invalid=946, Unknown=0, NotChecked=0, Total=1482 [2021-05-06 00:51:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2021-05-06 00:51:15,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1231. [2021-05-06 00:51:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1205 states have (on average 1.0174273858921161) internal successors, (1226), 1205 states have internal predecessors, (1226), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-05-06 00:51:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1265 transitions. [2021-05-06 00:51:15,029 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1265 transitions. Word has length 1147 [2021-05-06 00:51:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:51:15,030 INFO L480 AbstractCegarLoop]: Abstraction has 1231 states and 1265 transitions. [2021-05-06 00:51:15,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 8.131578947368421) internal successors, (309), 37 states have internal predecessors, (309), 33 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 31 states have call predecessors, (33), 32 states have call successors, (33) [2021-05-06 00:51:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1265 transitions. [2021-05-06 00:51:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1219 [2021-05-06 00:51:15,038 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:51:15,038 INFO L523 BasicCegarLoop]: trace histogram [340, 340, 340, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:51:15,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-05-06 00:51:15,239 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:51:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:51:15,240 INFO L82 PathProgramCache]: Analyzing trace with hash 722925404, now seen corresponding path program 16 times [2021-05-06 00:51:15,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:51:15,240 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001627650] [2021-05-06 00:51:15,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:51:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:51:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:51:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:51:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:51:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:51:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:51:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:51:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:51:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 00:51:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 00:51:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 00:51:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 00:51:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 00:51:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 00:51:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-06 00:51:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-06 00:51:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-06 00:51:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1143 [2021-05-06 00:51:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 180134 backedges. 48 proven. 169576 refuted. 0 times theorem prover too weak. 10510 trivial. 0 not checked. [2021-05-06 00:51:15,653 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:51:15,653 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001627650] [2021-05-06 00:51:15,653 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001627650] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:15,653 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046845516] [2021-05-06 00:51:15,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:15,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-06 00:51:15,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:51:15,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 1880 conjuncts, 40 conjunts are in the unsatisfiable core [2021-05-06 00:51:15,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:51:15,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:15,959 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:15,974 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:15,975 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:15,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:15,991 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,007 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,046 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,047 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,066 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,067 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,088 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,109 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,110 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,132 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,155 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,161 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,238 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,263 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,264 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,315 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,316 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,341 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,342 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,395 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,416 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,436 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,529 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,530 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,549 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,643 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,663 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,663 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,757 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,758 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,778 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,778 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,905 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:16,906 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,000 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,001 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,021 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,022 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,115 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,232 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,233 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,256 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,352 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,353 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,376 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,377 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,473 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,497 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,498 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,594 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,595 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,718 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,743 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,744 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,842 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,843 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,868 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,869 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,968 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,969 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,999 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:17,999 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:18,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:18,115 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:18,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:18,143 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:18,243 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:18,244 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:18,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:18,273 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:18,375 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:18,375 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:18,405 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 180134 backedges. 580 proven. 169634 refuted. 0 times theorem prover too weak. 9920 trivial. 0 not checked. [2021-05-06 00:51:18,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046845516] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:18,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:51:18,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 42] total 61 [2021-05-06 00:51:18,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468941794] [2021-05-06 00:51:18,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-06 00:51:18,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:51:18,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-06 00:51:18,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=844, Invalid=2816, Unknown=0, NotChecked=0, Total=3660 [2021-05-06 00:51:18,419 INFO L87 Difference]: Start difference. First operand 1231 states and 1265 transitions. Second operand has 61 states, 61 states have (on average 6.278688524590164) internal successors, (383), 60 states have internal predecessors, (383), 35 states have call successors, (39), 4 states have call predecessors, (39), 2 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) [2021-05-06 00:51:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:51:19,287 INFO L93 Difference]: Finished difference Result 1437 states and 1478 transitions. [2021-05-06 00:51:19,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-06 00:51:19,287 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 6.278688524590164) internal successors, (383), 60 states have internal predecessors, (383), 35 states have call successors, (39), 4 states have call predecessors, (39), 2 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) Word has length 1218 [2021-05-06 00:51:19,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:51:19,289 INFO L225 Difference]: With dead ends: 1437 [2021-05-06 00:51:19,290 INFO L226 Difference]: Without dead ends: 1364 [2021-05-06 00:51:19,290 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1295 GetRequests, 1183 SyntacticMatches, 32 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2629 ImplicationChecksByTransitivity, 1497.0ms TimeCoverageRelationStatistics Valid=2048, Invalid=4594, Unknown=0, NotChecked=0, Total=6642 [2021-05-06 00:51:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2021-05-06 00:51:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1298. [2021-05-06 00:51:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1271 states have (on average 1.017309205350118) internal successors, (1293), 1271 states have internal predecessors, (1293), 21 states have call successors, (21), 6 states have call predecessors, (21), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-05-06 00:51:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1334 transitions. [2021-05-06 00:51:19,359 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1334 transitions. Word has length 1218 [2021-05-06 00:51:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:51:19,359 INFO L480 AbstractCegarLoop]: Abstraction has 1298 states and 1334 transitions. [2021-05-06 00:51:19,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 61 states have (on average 6.278688524590164) internal successors, (383), 60 states have internal predecessors, (383), 35 states have call successors, (39), 4 states have call predecessors, (39), 2 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) [2021-05-06 00:51:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1334 transitions. [2021-05-06 00:51:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1290 [2021-05-06 00:51:19,369 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:51:19,370 INFO L523 BasicCegarLoop]: trace histogram [360, 360, 360, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:51:19,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-05-06 00:51:19,589 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:51:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:51:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1522074655, now seen corresponding path program 17 times [2021-05-06 00:51:19,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:51:19,590 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132899645] [2021-05-06 00:51:19,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:51:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:51:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:51:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:51:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:51:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:51:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:51:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:51:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:51:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 00:51:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 00:51:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 00:51:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 00:51:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 00:51:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 00:51:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-06 00:51:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-06 00:51:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-06 00:51:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1143 [2021-05-06 00:51:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1214 [2021-05-06 00:51:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 201989 backedges. 51 proven. 190774 refuted. 0 times theorem prover too weak. 11164 trivial. 0 not checked. [2021-05-06 00:51:20,199 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:51:20,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132899645] [2021-05-06 00:51:20,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132899645] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:20,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831277] [2021-05-06 00:51:20,199 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:21,208 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 156 check-sat command(s) [2021-05-06 00:51:21,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:51:21,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 43 conjunts are in the unsatisfiable core [2021-05-06 00:51:21,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:51:21,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,309 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,323 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,388 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,389 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,402 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,425 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,442 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,443 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,461 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,462 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,481 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,501 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,520 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,610 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,659 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,696 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,697 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,751 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,752 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,778 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,780 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,809 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,810 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,838 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,879 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,909 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,910 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,984 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:21,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,003 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,004 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,096 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,121 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,214 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,214 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,235 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,235 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,341 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,342 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,363 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,364 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,460 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,481 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,576 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,577 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,600 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,696 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,720 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,815 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,853 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,966 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,991 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:22,992 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,090 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,091 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,215 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,241 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,243 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,341 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,345 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,372 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,372 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,472 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,504 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,633 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,736 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,765 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,766 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,866 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,895 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 201989 backedges. 741 proven. 190794 refuted. 0 times theorem prover too weak. 10454 trivial. 0 not checked. [2021-05-06 00:51:23,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831277] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:23,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:51:23,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 44] total 64 [2021-05-06 00:51:23,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501208381] [2021-05-06 00:51:23,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-06 00:51:23,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:51:23,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-06 00:51:23,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=893, Invalid=3139, Unknown=0, NotChecked=0, Total=4032 [2021-05-06 00:51:23,910 INFO L87 Difference]: Start difference. First operand 1298 states and 1334 transitions. Second operand has 64 states, 64 states have (on average 6.265625) internal successors, (401), 63 states have internal predecessors, (401), 37 states have call successors, (41), 4 states have call predecessors, (41), 2 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2021-05-06 00:51:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:51:25,544 INFO L93 Difference]: Finished difference Result 1504 states and 1547 transitions. [2021-05-06 00:51:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-05-06 00:51:25,545 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 6.265625) internal successors, (401), 63 states have internal predecessors, (401), 37 states have call successors, (41), 4 states have call predecessors, (41), 2 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) Word has length 1289 [2021-05-06 00:51:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:51:25,547 INFO L225 Difference]: With dead ends: 1504 [2021-05-06 00:51:25,547 INFO L226 Difference]: Without dead ends: 1431 [2021-05-06 00:51:25,549 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1411 GetRequests, 1256 SyntacticMatches, 30 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5143 ImplicationChecksByTransitivity, 2200.1ms TimeCoverageRelationStatistics Valid=5372, Invalid=10630, Unknown=0, NotChecked=0, Total=16002 [2021-05-06 00:51:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2021-05-06 00:51:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1365. [2021-05-06 00:51:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1337 states have (on average 1.0172026925953628) internal successors, (1360), 1337 states have internal predecessors, (1360), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2021-05-06 00:51:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1403 transitions. [2021-05-06 00:51:25,608 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1403 transitions. Word has length 1289 [2021-05-06 00:51:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:51:25,608 INFO L480 AbstractCegarLoop]: Abstraction has 1365 states and 1403 transitions. [2021-05-06 00:51:25,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 64 states have (on average 6.265625) internal successors, (401), 63 states have internal predecessors, (401), 37 states have call successors, (41), 4 states have call predecessors, (41), 2 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2021-05-06 00:51:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1403 transitions. [2021-05-06 00:51:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1361 [2021-05-06 00:51:25,634 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:51:25,634 INFO L523 BasicCegarLoop]: trace histogram [380, 380, 380, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:51:25,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-05-06 00:51:25,835 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:51:25,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:51:25,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1329958980, now seen corresponding path program 18 times [2021-05-06 00:51:25,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:51:25,835 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130639966] [2021-05-06 00:51:25,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:51:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 00:51:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 00:51:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 00:51:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 00:51:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 00:51:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 00:51:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 00:51:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 00:51:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 00:51:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 00:51:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 00:51:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 00:51:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 00:51:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 00:51:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-06 00:51:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-06 00:51:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-06 00:51:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1143 [2021-05-06 00:51:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1214 [2021-05-06 00:51:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1285 [2021-05-06 00:51:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 00:51:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 225095 backedges. 54 proven. 213219 refuted. 0 times theorem prover too weak. 11822 trivial. 0 not checked. [2021-05-06 00:51:26,318 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 00:51:26,318 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130639966] [2021-05-06 00:51:26,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130639966] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:26,318 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73038617] [2021-05-06 00:51:26,318 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:27,015 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 145 check-sat command(s) [2021-05-06 00:51:27,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 00:51:27,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 22 conjunts are in the unsatisfiable core [2021-05-06 00:51:27,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 00:51:27,122 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,123 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,222 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,223 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,301 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,410 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,411 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,423 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,423 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,501 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,515 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,516 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,600 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,601 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,615 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,616 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,692 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,706 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,784 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,798 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,876 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,891 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,892 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,969 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,970 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:27,986 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,062 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,063 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,083 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,162 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,162 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,180 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,355 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,373 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,374 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,461 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,462 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,496 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,572 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,573 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,594 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,673 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,696 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,772 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,773 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,795 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,871 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,872 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,893 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 00:51:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 225095 backedges. 54 proven. 213219 refuted. 0 times theorem prover too weak. 11822 trivial. 0 not checked. [2021-05-06 00:51:28,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73038617] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 00:51:28,906 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 00:51:28,907 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2021-05-06 00:51:28,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752112221] [2021-05-06 00:51:28,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-06 00:51:28,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 00:51:28,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-06 00:51:28,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=1177, Unknown=0, NotChecked=0, Total=1892 [2021-05-06 00:51:28,908 INFO L87 Difference]: Start difference. First operand 1365 states and 1403 transitions. Second operand has 44 states, 44 states have (on average 8.25) internal successors, (363), 43 states have internal predecessors, (363), 39 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 37 states have call predecessors, (39), 38 states have call successors, (39) [2021-05-06 00:51:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 00:51:29,354 INFO L93 Difference]: Finished difference Result 1571 states and 1616 transitions. [2021-05-06 00:51:29,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-06 00:51:29,355 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 8.25) internal successors, (363), 43 states have internal predecessors, (363), 39 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 37 states have call predecessors, (39), 38 states have call successors, (39) Word has length 1360 [2021-05-06 00:51:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 00:51:29,357 INFO L225 Difference]: With dead ends: 1571 [2021-05-06 00:51:29,357 INFO L226 Difference]: Without dead ends: 1498 [2021-05-06 00:51:29,358 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1423 GetRequests, 1380 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 476.5ms TimeCoverageRelationStatistics Valid=719, Invalid=1261, Unknown=0, NotChecked=0, Total=1980 [2021-05-06 00:51:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2021-05-06 00:51:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1432. [2021-05-06 00:51:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1403 states have (on average 1.0171062009978618) internal successors, (1427), 1403 states have internal predecessors, (1427), 23 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-06 00:51:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1472 transitions. [2021-05-06 00:51:29,421 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1472 transitions. Word has length 1360 [2021-05-06 00:51:29,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 00:51:29,421 INFO L480 AbstractCegarLoop]: Abstraction has 1432 states and 1472 transitions. [2021-05-06 00:51:29,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 8.25) internal successors, (363), 43 states have internal predecessors, (363), 39 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 37 states have call predecessors, (39), 38 states have call successors, (39) [2021-05-06 00:51:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1472 transitions. [2021-05-06 00:51:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1432 [2021-05-06 00:51:29,443 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 00:51:29,444 INFO L523 BasicCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 00:51:29,644 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 00:51:29,644 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 00:51:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 00:51:29,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1961863295, now seen corresponding path program 19 times [2021-05-06 00:51:29,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 00:51:29,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467208091] [2021-05-06 00:51:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 00:51:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-06 00:51:29,815 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-06 00:51:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-06 00:51:30,006 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-06 00:51:30,273 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-06 00:51:30,273 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-06 00:51:30,273 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-05-06 00:51:30,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 12:51:30 BoogieIcfgContainer [2021-05-06 00:51:30,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 00:51:30,490 INFO L168 Benchmark]: Toolchain (without parser) took 98698.26 ms. Allocated memory was 206.6 MB in the beginning and 746.6 MB in the end (delta: 540.0 MB). Free memory was 171.8 MB in the beginning and 702.0 MB in the end (delta: -530.3 MB). Peak memory consumption was 446.2 MB. Max. memory is 8.0 GB. [2021-05-06 00:51:30,490 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 206.6 MB. Free memory is still 188.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 00:51:30,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.03 ms. Allocated memory is still 206.6 MB. Free memory was 171.5 MB in the beginning and 189.8 MB in the end (delta: -18.3 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-05-06 00:51:30,490 INFO L168 Benchmark]: Boogie Preprocessor took 32.84 ms. Allocated memory is still 206.6 MB. Free memory was 189.8 MB in the beginning and 188.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 00:51:30,491 INFO L168 Benchmark]: RCFGBuilder took 337.89 ms. Allocated memory is still 206.6 MB. Free memory was 187.8 MB in the beginning and 172.0 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-05-06 00:51:30,491 INFO L168 Benchmark]: TraceAbstraction took 98171.02 ms. Allocated memory was 206.6 MB in the beginning and 746.6 MB in the end (delta: 540.0 MB). Free memory was 171.3 MB in the beginning and 702.0 MB in the end (delta: -530.7 MB). Peak memory consumption was 445.2 MB. Max. memory is 8.0 GB. [2021-05-06 00:51:30,491 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.11 ms. Allocated memory is still 206.6 MB. Free memory is still 188.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 150.03 ms. Allocated memory is still 206.6 MB. Free memory was 171.5 MB in the beginning and 189.8 MB in the end (delta: -18.3 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.84 ms. Allocated memory is still 206.6 MB. Free memory was 189.8 MB in the beginning and 188.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 337.89 ms. Allocated memory is still 206.6 MB. Free memory was 187.8 MB in the beginning and 172.0 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 98171.02 ms. Allocated memory was 206.6 MB in the beginning and 746.6 MB in the end (delta: 540.0 MB). Free memory was 171.3 MB in the beginning and 702.0 MB in the end (delta: -530.7 MB). Peak memory consumption was 445.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L9] int last ; [L18] int SIZE = 20; VAL [\old(last)=52, \old(SIZE)=51, last=0, SIZE=20] [L20] last = __VERIFIER_nondet_int() [L21] CALL assume_abort_if_not(last > 0) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L6] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L21] RET assume_abort_if_not(last > 0) VAL [\old(last)=0, last=22, SIZE=20] [L22] int a=0,b=0,c=0,st=0,d=0; VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=22, SIZE=20, st=0] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=1, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=1, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=2, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=2, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=3, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=3, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=4, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=4, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=5, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=5, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=6, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=6, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=7, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=7, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=8, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=8, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=9, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=9, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=10, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=10, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=11, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=11, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=12, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=12, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=13, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=13, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=14, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=14, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=15, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=15, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=16, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=16, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=17, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=17, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=18, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=18, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=19, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=19, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=20, d=0, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=2, b=2, c=0, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=0, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=1, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=1, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=2, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=2, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=3, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=3, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=4, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=4, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=5, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=5, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=6, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=6, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=7, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=7, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=8, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=8, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=9, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=9, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=10, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=10, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=11, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=11, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=12, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=12, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=13, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=13, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=14, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=14, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=15, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=15, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=16, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=16, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=17, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=17, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=18, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=18, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=19, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=19, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=4, b=4, c=0, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=0, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=1, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=1, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=2, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=2, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=3, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=3, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=4, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=4, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=5, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=5, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=6, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=6, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=7, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=7, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=8, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=8, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=9, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=9, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=10, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=10, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=11, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=11, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=12, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=12, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=13, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=13, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=14, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=14, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=15, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=15, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=16, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=16, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=17, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=17, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=18, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=18, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=19, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=19, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=6, b=6, c=0, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=0, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=1, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=1, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=2, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=2, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=3, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=3, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=4, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=4, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=5, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=5, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=6, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=6, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=7, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=7, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=8, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=8, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=9, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=9, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=10, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=10, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=11, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=11, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=12, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=12, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=13, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=13, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=14, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=14, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=15, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=15, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=16, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=16, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=17, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=17, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=18, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=18, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=19, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=19, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=8, b=8, c=0, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=0, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=1, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=1, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=2, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=2, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=3, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=3, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=4, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=4, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=5, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=5, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=6, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=6, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=7, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=7, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=8, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=8, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=9, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=9, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=10, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=10, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=11, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=11, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=12, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=12, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=13, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=13, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=14, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=14, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=15, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=15, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=16, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=16, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=17, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=17, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=18, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=18, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=19, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=19, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=10, b=10, c=0, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=0, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=1, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=1, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=2, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=2, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=3, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=3, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=4, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=4, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=5, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=5, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=6, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=6, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=7, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=7, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=8, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=8, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=9, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=9, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=10, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=10, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=11, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=11, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=12, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=12, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=13, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=13, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=14, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=14, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=15, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=15, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=16, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=16, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=17, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=17, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=18, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=18, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=19, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=19, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=12, b=12, c=0, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=0, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=1, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=1, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=2, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=2, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=3, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=3, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=4, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=4, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=5, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=5, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=6, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=6, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=7, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=7, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=8, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=8, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=9, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=9, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=10, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=10, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=11, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=11, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=12, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=12, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=13, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=13, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=14, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=14, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=15, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=15, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=16, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=16, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=17, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=17, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=18, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=18, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=19, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=19, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=14, b=14, c=0, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=0, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=1, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=1, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=2, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=2, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=3, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=3, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=4, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=4, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=5, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=5, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=6, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=6, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=7, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=7, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=8, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=8, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=9, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=9, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=10, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=10, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=11, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=11, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=12, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=12, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=13, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=13, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=14, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=14, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=15, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=15, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=16, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=16, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=17, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=17, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=18, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=18, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=19, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=19, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=16, b=16, c=0, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=0, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=1, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=1, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=2, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=2, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=3, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=3, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=4, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=4, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=5, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=5, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=6, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=6, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=7, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=7, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=8, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=8, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=9, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=9, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=10, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=10, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=11, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=11, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=12, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=12, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=13, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=13, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=14, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=14, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=15, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=15, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=16, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=16, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=17, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=17, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=18, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=18, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=19, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=19, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=18, b=18, c=0, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=0, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=1, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=1, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=2, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=2, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=3, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=3, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=4, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=4, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=5, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=5, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=6, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=6, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=7, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=7, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=8, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=8, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=9, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=9, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=10, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=10, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=11, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=11, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=12, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=12, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=13, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=13, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=14, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=14, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=15, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=15, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=16, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=16, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=17, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=17, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=18, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=18, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=19, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=19, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=20, b=20, c=0, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=0, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=1, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=1, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=2, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=2, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=3, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=3, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=4, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=4, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=5, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=5, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=6, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=6, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=7, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=7, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=8, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=8, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=9, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=9, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=10, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=10, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=11, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=11, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=12, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=12, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=13, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=13, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=14, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=14, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=15, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=15, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=16, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=16, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=17, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=17, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=18, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=18, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=19, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=19, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=22, b=22, c=0, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=0, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=1, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=1, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=2, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=2, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=3, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=3, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=4, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=4, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=5, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=5, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=6, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=6, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=7, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=7, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=8, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=8, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=9, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=9, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=10, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=10, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=11, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=11, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=12, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=12, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=13, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=13, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=14, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=14, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=15, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=15, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=16, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=16, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=17, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=17, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=18, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=18, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=19, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=19, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=24, b=24, c=0, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=0, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=1, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=1, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=2, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=2, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=3, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=3, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=4, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=4, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=5, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=5, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=6, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=6, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=7, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=7, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=8, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=8, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=9, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=9, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=10, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=10, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=11, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=11, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=12, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=12, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=13, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=13, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=14, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=14, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=15, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=15, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=16, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=16, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=17, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=17, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=18, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=18, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=19, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=19, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=26, b=26, c=0, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=0, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=1, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=1, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=2, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=2, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=3, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=3, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=4, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=4, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=5, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=5, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=6, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=6, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=7, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=7, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=8, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=8, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=9, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=9, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=10, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=10, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=11, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=11, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=12, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=12, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=13, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=13, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=14, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=14, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=15, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=15, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=16, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=16, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=17, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=17, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=18, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=18, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=19, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=19, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=28, b=28, c=0, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=0, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=1, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=1, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=2, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=2, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=3, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=3, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=4, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=4, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=5, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=5, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=6, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=6, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=7, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=7, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=8, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=8, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=9, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=9, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=10, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=10, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=11, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=11, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=12, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=12, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=13, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=13, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=14, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=14, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=15, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=15, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=16, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=16, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=17, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=17, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=18, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=18, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=19, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=19, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=30, b=30, c=0, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=0, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=1, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=1, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=2, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=2, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=3, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=3, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=4, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=4, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=5, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=5, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=6, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=6, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=7, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=7, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=8, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=8, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=9, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=9, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=10, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=10, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=11, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=11, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=12, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=12, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=13, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=13, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=14, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=14, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=15, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=15, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=16, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=16, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=17, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=17, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=18, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=18, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=19, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=19, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=32, b=32, c=0, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=0, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=1, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=1, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=2, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=2, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=3, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=3, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=4, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=4, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=5, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=5, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=6, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=6, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=7, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=7, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=8, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=8, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=9, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=9, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=10, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=10, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=11, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=11, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=12, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=12, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=13, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=13, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=14, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=14, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=15, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=15, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=16, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=16, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=17, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=17, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=18, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=18, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=19, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=19, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=34, b=34, c=0, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=0, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=1, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=1, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=2, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=2, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=3, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=3, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=4, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=4, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=5, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=5, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=6, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=6, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=7, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=7, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=8, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=8, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=9, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=9, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=10, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=10, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=11, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=11, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=12, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=12, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=13, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=13, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=14, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=14, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=15, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=15, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=16, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=16, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=17, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=17, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=18, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=18, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=19, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=19, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=36, b=36, c=0, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=0, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=1, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=1, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=2, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=2, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=3, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=3, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=4, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=4, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=5, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=5, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=6, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=6, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=7, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=7, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=8, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=8, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=9, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=9, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=10, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=10, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=11, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=11, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=12, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=12, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=13, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=13, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=14, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=14, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=15, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=15, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=16, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=16, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=17, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=17, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=18, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=18, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=19, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=19, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=38, b=38, c=0, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=0, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=1, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=1, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=2, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=2, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=3, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=3, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=4, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=4, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=5, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=5, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=6, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=6, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=7, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=7, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=8, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=8, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=9, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=9, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=10, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=10, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=11, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=11, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=12, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=12, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=13, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=13, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=14, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=14, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=15, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=15, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=16, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=16, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=17, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=17, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=18, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=18, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=19, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=19, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=40, b=40, c=20, d=20, last=22, SIZE=20, st=1] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [\old(last)=0, a=0, b=1, c=20, d=20, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=0, \old(last)=0, last=22, SIZE=20] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(last)=0, cond=0, last=22, SIZE=20] [L12] reach_error() VAL [\old(cond)=0, \old(last)=0, cond=0, last=22, SIZE=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 97922.2ms, OverallIterations: 54, TraceHistogramMax: 400, EmptinessCheckTime: 163.0ms, AutomataDifference: 34779.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1164 SDtfs, 9293 SDslu, 3582 SDs, 0 SdLazy, 36244 SolverSat, 2463 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13115.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18385 GetRequests, 15992 SyntacticMatches, 120 SemanticMatches, 2273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57666 ImplicationChecksByTransitivity, 32651.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1523occurred in iteration=33, InterpolantAutomatonStates: 1554, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1458.4ms AutomataMinimizationTime, 53 MinimizatonAttempts, 4381 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1100.5ms SsaConstructionTime, 6392.5ms SatisfiabilityAnalysisTime, 42037.3ms InterpolantComputationTime, 33963 NumberOfCodeBlocks, 32732 NumberOfCodeBlocksAsserted, 1010 NumberOfCheckSat, 32432 ConstructedInterpolants, 0 QuantifiedInterpolants, 179494 SizeOfPredicates, 119 NumberOfNonLiveVariables, 27223 ConjunctsInSsa, 892 ConjunctsInUnsatCore, 100 InterpolantComputations, 11 PerfectInterpolantSequences, 262907/3130368 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...