/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 18:53:03,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 18:53:03,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 18:53:03,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 18:53:03,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 18:53:03,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 18:53:03,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 18:53:03,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 18:53:03,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 18:53:03,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 18:53:03,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 18:53:03,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 18:53:03,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 18:53:03,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 18:53:03,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 18:53:03,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 18:53:03,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 18:53:03,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 18:53:03,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 18:53:03,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 18:53:03,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 18:53:03,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 18:53:03,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 18:53:03,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 18:53:03,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 18:53:03,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 18:53:03,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 18:53:03,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 18:53:03,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 18:53:03,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 18:53:03,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 18:53:03,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 18:53:03,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 18:53:03,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 18:53:03,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 18:53:03,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 18:53:03,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 18:53:03,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 18:53:03,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 18:53:03,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 18:53:03,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 18:53:03,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2021-05-02 18:53:03,385 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 18:53:03,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 18:53:03,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 18:53:03,386 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 18:53:03,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 18:53:03,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 18:53:03,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 18:53:03,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 18:53:03,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 18:53:03,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 18:53:03,387 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 18:53:03,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 18:53:03,388 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 18:53:03,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 18:53:03,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 18:53:03,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 18:53:03,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 18:53:03,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 18:53:03,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 18:53:03,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 18:53:03,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 18:53:03,390 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-05-02 18:53:03,390 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-02 18:53:03,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 18:53:03,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 18:53:03,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 18:53:03,710 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 18:53:03,711 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 18:53:03,711 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-02 18:53:03,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b93845576/7b6dd0ba56a449adbe12a11f866ae2e1/FLAGf678278b5 [2021-05-02 18:53:04,139 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 18:53:04,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2021-05-02 18:53:04,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b93845576/7b6dd0ba56a449adbe12a11f866ae2e1/FLAGf678278b5 [2021-05-02 18:53:04,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b93845576/7b6dd0ba56a449adbe12a11f866ae2e1 [2021-05-02 18:53:04,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 18:53:04,487 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-02 18:53:04,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 18:53:04,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 18:53:04,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 18:53:04,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 06:53:04" (1/1) ... [2021-05-02 18:53:04,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10063fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:53:04, skipping insertion in model container [2021-05-02 18:53:04,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 06:53:04" (1/1) ... [2021-05-02 18:53:04,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 18:53:04,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 18:53:04,614 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-02 18:53:04,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 18:53:04,632 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 18:53:04,642 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-02 18:53:04,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 18:53:04,658 INFO L208 MainTranslator]: Completed translation [2021-05-02 18:53:04,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:53:04 WrapperNode [2021-05-02 18:53:04,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 18:53:04,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 18:53:04,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 18:53:04,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 18:53:04,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:53:04" (1/1) ... [2021-05-02 18:53:04,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:53:04" (1/1) ... [2021-05-02 18:53:04,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:53:04" (1/1) ... [2021-05-02 18:53:04,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:53:04" (1/1) ... [2021-05-02 18:53:04,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:53:04" (1/1) ... [2021-05-02 18:53:04,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:53:04" (1/1) ... [2021-05-02 18:53:04,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:53:04" (1/1) ... [2021-05-02 18:53:04,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 18:53:04,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 18:53:04,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 18:53:04,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 18:53:04,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:53:04" (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-02 18:53:04,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 18:53:04,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 18:53:04,795 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 18:53:04,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 18:53:04,795 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 18:53:04,795 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 18:53:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 18:53:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 18:53:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 18:53:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 18:53:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 18:53:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 18:53:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 18:53:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 18:53:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 18:53:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 18:53:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 18:53:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 18:53:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 18:53:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 18:53:05,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 18:53:05,104 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-02 18:53:05,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 06:53:05 BoogieIcfgContainer [2021-05-02 18:53:05,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 18:53:05,106 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2021-05-02 18:53:05,106 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2021-05-02 18:53:05,106 INFO L275 PluginConnector]: IcfgTransformer initialized [2021-05-02 18:53:05,109 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 06:53:05" (1/1) ... [2021-05-02 18:53:05,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 02.05 06:53:05 BasicIcfg [2021-05-02 18:53:05,121 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2021-05-02 18:53:05,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 18:53:05,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 18:53:05,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 18:53:05,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 06:53:04" (1/4) ... [2021-05-02 18:53:05,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c96ba19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 06:53:05, skipping insertion in model container [2021-05-02 18:53:05,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:53:04" (2/4) ... [2021-05-02 18:53:05,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c96ba19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 06:53:05, skipping insertion in model container [2021-05-02 18:53:05,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 06:53:05" (3/4) ... [2021-05-02 18:53:05,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c96ba19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 06:53:05, skipping insertion in model container [2021-05-02 18:53:05,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 02.05 06:53:05" (4/4) ... [2021-05-02 18:53:05,127 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.cJordan [2021-05-02 18:53:05,131 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2021-05-02 18:53:05,134 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 18:53:05,148 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 18:53:05,164 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 18:53:05,164 INFO L377 AbstractCegarLoop]: Hoare is false [2021-05-02 18:53:05,164 INFO L378 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2021-05-02 18:53:05,165 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 18:53:05,165 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 18:53:05,165 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 18:53:05,165 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 18:53:05,165 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 18:53:05,174 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-02 18:53:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 18:53:05,180 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:05,181 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-02 18:53:05,181 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:05,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:05,185 INFO L82 PathProgramCache]: Analyzing trace with hash -414317756, now seen corresponding path program 1 times [2021-05-02 18:53:05,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:05,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680138998] [2021-05-02 18:53:05,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:05,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:05,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:05,366 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-02 18:53:05,366 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:05,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680138998] [2021-05-02 18:53:05,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680138998] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:53:05,367 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:53:05,367 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 18:53:05,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936319414] [2021-05-02 18:53:05,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 18:53:05,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:05,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 18:53:05,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 18:53:05,392 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-02 18:53:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:05,468 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2021-05-02 18:53:05,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 18:53:05,470 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-02 18:53:05,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:05,476 INFO L225 Difference]: With dead ends: 27 [2021-05-02 18:53:05,477 INFO L226 Difference]: Without dead ends: 27 [2021-05-02 18:53:05,478 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 18:53:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-02 18:53:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-02 18:53:05,499 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-02 18:53:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-05-02 18:53:05,501 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2021-05-02 18:53:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:05,501 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-05-02 18:53:05,501 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-02 18:53:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-05-02 18:53:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 18:53:05,502 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:05,502 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-02 18:53:05,502 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 18:53:05,502 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:05,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:05,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1035089572, now seen corresponding path program 1 times [2021-05-02 18:53:05,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:05,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101762799] [2021-05-02 18:53:05,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:05,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:05,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:05,708 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-02 18:53:05,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:05,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101762799] [2021-05-02 18:53:05,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101762799] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:53:05,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:53:05,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 18:53:05,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964150337] [2021-05-02 18:53:05,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 18:53:05,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:05,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 18:53:05,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-02 18:53:05,712 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-02 18:53:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:05,894 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2021-05-02 18:53:05,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 18:53:05,895 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-02 18:53:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:05,897 INFO L225 Difference]: With dead ends: 31 [2021-05-02 18:53:05,897 INFO L226 Difference]: Without dead ends: 31 [2021-05-02 18:53:05,898 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 125.4ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-02 18:53:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-02 18:53:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-05-02 18:53:05,901 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-02 18:53:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-05-02 18:53:05,902 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2021-05-02 18:53:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:05,902 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-05-02 18:53:05,902 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-02 18:53:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-05-02 18:53:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 18:53:05,903 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:05,903 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-02 18:53:05,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 18:53:05,903 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:05,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:05,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2124918270, now seen corresponding path program 1 times [2021-05-02 18:53:05,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:05,905 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481705824] [2021-05-02 18:53:05,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:06,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:06,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:06,045 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-02 18:53:06,045 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:06,045 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481705824] [2021-05-02 18:53:06,045 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481705824] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:53:06,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:53:06,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 18:53:06,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312750901] [2021-05-02 18:53:06,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 18:53:06,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 18:53:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 18:53:06,047 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-02 18:53:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:06,137 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-05-02 18:53:06,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 18:53:06,137 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-02 18:53:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:06,143 INFO L225 Difference]: With dead ends: 33 [2021-05-02 18:53:06,143 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 18:53:06,143 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 18:53:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 18:53:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-05-02 18:53:06,154 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-02 18:53:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-05-02 18:53:06,156 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2021-05-02 18:53:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:06,157 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-05-02 18:53:06,157 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-02 18:53:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2021-05-02 18:53:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 18:53:06,159 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:06,159 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-02 18:53:06,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 18:53:06,159 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:06,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:06,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1237414589, now seen corresponding path program 1 times [2021-05-02 18:53:06,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:06,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311875528] [2021-05-02 18:53:06,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:06,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:06,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:06,271 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-02 18:53:06,271 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:06,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311875528] [2021-05-02 18:53:06,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311875528] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:53:06,271 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:53:06,272 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 18:53:06,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525233071] [2021-05-02 18:53:06,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 18:53:06,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:06,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 18:53:06,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 18:53:06,273 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-02 18:53:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:06,391 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2021-05-02 18:53:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 18:53:06,392 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-02 18:53:06,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:06,393 INFO L225 Difference]: With dead ends: 40 [2021-05-02 18:53:06,393 INFO L226 Difference]: Without dead ends: 40 [2021-05-02 18:53:06,394 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 78.9ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-05-02 18:53:06,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-02 18:53:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-05-02 18:53:06,398 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-02 18:53:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2021-05-02 18:53:06,399 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2021-05-02 18:53:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:06,399 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2021-05-02 18:53:06,399 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-02 18:53:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2021-05-02 18:53:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 18:53:06,400 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:06,400 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-02 18:53:06,400 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 18:53:06,401 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:06,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:06,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1236491068, now seen corresponding path program 1 times [2021-05-02 18:53:06,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:06,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687258638] [2021-05-02 18:53:06,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:06,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:06,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:06,477 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-02 18:53:06,477 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:06,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687258638] [2021-05-02 18:53:06,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687258638] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:06,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996207902] [2021-05-02 18:53:06,478 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-02 18:53:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:06,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-02 18:53:06,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:06,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:06,655 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:06,681 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:06,698 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-02 18:53:06,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996207902] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:06,699 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:06,699 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2021-05-02 18:53:06,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003746520] [2021-05-02 18:53:06,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 18:53:06,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:06,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 18:53:06,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 18:53:06,701 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-02 18:53:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:06,840 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2021-05-02 18:53:06,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 18:53:06,843 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-02 18:53:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:06,847 INFO L225 Difference]: With dead ends: 51 [2021-05-02 18:53:06,847 INFO L226 Difference]: Without dead ends: 51 [2021-05-02 18:53:06,848 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 102.2ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-05-02 18:53:06,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-02 18:53:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2021-05-02 18:53:06,860 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-02 18:53:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2021-05-02 18:53:06,864 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 24 [2021-05-02 18:53:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:06,864 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2021-05-02 18:53:06,864 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-02 18:53:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2021-05-02 18:53:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 18:53:06,865 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:06,865 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-02 18:53:07,066 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:07,066 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:07,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:07,067 INFO L82 PathProgramCache]: Analyzing trace with hash 358048934, now seen corresponding path program 2 times [2021-05-02 18:53:07,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:07,067 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482149977] [2021-05-02 18:53:07,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:07,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:07,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:07,150 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-02 18:53:07,150 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:07,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482149977] [2021-05-02 18:53:07,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482149977] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:07,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064134077] [2021-05-02 18:53:07,151 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-02 18:53:07,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 18:53:07,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:07,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-02 18:53:07,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:07,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:07,281 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:07,300 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-02 18:53:07,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064134077] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:53:07,301 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-02 18:53:07,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2021-05-02 18:53:07,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003328574] [2021-05-02 18:53:07,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 18:53:07,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:07,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 18:53:07,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-02 18:53:07,302 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-02 18:53:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:07,399 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2021-05-02 18:53:07,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 18:53:07,401 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-02 18:53:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:07,404 INFO L225 Difference]: With dead ends: 88 [2021-05-02 18:53:07,404 INFO L226 Difference]: Without dead ends: 88 [2021-05-02 18:53:07,405 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 86.1ms TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-05-02 18:53:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-05-02 18:53:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2021-05-02 18:53:07,418 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-02 18:53:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2021-05-02 18:53:07,422 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 27 [2021-05-02 18:53:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:07,423 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2021-05-02 18:53:07,423 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-02 18:53:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2021-05-02 18:53:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 18:53:07,424 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:07,424 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-02 18:53:07,646 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:07,646 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:07,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:07,647 INFO L82 PathProgramCache]: Analyzing trace with hash -131867578, now seen corresponding path program 1 times [2021-05-02 18:53:07,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:07,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392473034] [2021-05-02 18:53:07,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:07,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:07,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:07,702 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-02 18:53:07,702 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:07,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392473034] [2021-05-02 18:53:07,703 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392473034] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:53:07,703 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:53:07,703 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 18:53:07,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107889894] [2021-05-02 18:53:07,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 18:53:07,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:07,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 18:53:07,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 18:53:07,704 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-02 18:53:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:07,761 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2021-05-02 18:53:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 18:53:07,762 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-02 18:53:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:07,762 INFO L225 Difference]: With dead ends: 97 [2021-05-02 18:53:07,763 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 18:53:07,763 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 18:53:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 18:53:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2021-05-02 18:53:07,767 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-02 18:53:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2021-05-02 18:53:07,768 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 27 [2021-05-02 18:53:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:07,768 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2021-05-02 18:53:07,768 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-02 18:53:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2021-05-02 18:53:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-02 18:53:07,769 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:07,769 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-02 18:53:07,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 18:53:07,770 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:07,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:07,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1708732761, now seen corresponding path program 1 times [2021-05-02 18:53:07,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:07,770 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657441368] [2021-05-02 18:53:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:07,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:07,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:07,841 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-02 18:53:07,841 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:07,841 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657441368] [2021-05-02 18:53:07,842 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657441368] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:07,842 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127301837] [2021-05-02 18:53:07,842 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-02 18:53:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:07,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-02 18:53:07,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:07,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:07,962 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:07,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:07,993 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:08,010 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:08,023 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-02 18:53:08,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127301837] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:08,023 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:08,023 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-05-02 18:53:08,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707173455] [2021-05-02 18:53:08,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 18:53:08,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:08,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 18:53:08,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-02 18:53:08,025 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-02 18:53:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:08,174 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-05-02 18:53:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 18:53:08,174 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-02 18:53:08,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:08,175 INFO L225 Difference]: With dead ends: 117 [2021-05-02 18:53:08,175 INFO L226 Difference]: Without dead ends: 117 [2021-05-02 18:53:08,176 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 96.3ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-05-02 18:53:08,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-02 18:53:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2021-05-02 18:53:08,180 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-02 18:53:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-05-02 18:53:08,181 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 28 [2021-05-02 18:53:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:08,181 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-05-02 18:53:08,181 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-02 18:53:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-05-02 18:53:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 18:53:08,182 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:08,182 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-02 18:53:08,400 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:08,401 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1076023237, now seen corresponding path program 2 times [2021-05-02 18:53:08,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:08,401 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815191619] [2021-05-02 18:53:08,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:08,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:08,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:08,507 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-02 18:53:08,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:08,508 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815191619] [2021-05-02 18:53:08,508 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815191619] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:08,508 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003999256] [2021-05-02 18:53:08,508 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-02 18:53:08,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 18:53:08,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:08,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-02 18:53:08,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:08,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:08,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:08,618 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:08,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:08,657 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-02 18:53:08,657 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003999256] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:08,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:08,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2021-05-02 18:53:08,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805119196] [2021-05-02 18:53:08,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 18:53:08,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:08,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 18:53:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-05-02 18:53:08,660 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-02 18:53:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:09,284 INFO L93 Difference]: Finished difference Result 225 states and 281 transitions. [2021-05-02 18:53:09,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-02 18:53:09,285 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-02 18:53:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:09,286 INFO L225 Difference]: With dead ends: 225 [2021-05-02 18:53:09,286 INFO L226 Difference]: Without dead ends: 225 [2021-05-02 18:53:09,286 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 457.3ms TimeCoverageRelationStatistics Valid=320, Invalid=940, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 18:53:09,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-05-02 18:53:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2021-05-02 18:53:09,296 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-02 18:53:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 222 transitions. [2021-05-02 18:53:09,297 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 222 transitions. Word has length 31 [2021-05-02 18:53:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:09,298 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 222 transitions. [2021-05-02 18:53:09,298 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-02 18:53:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2021-05-02 18:53:09,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-02 18:53:09,303 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:09,303 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-02 18:53:09,525 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:09,525 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:09,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:09,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1589140216, now seen corresponding path program 1 times [2021-05-02 18:53:09,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:09,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818710380] [2021-05-02 18:53:09,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:09,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:09,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:09,627 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-02 18:53:09,627 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:09,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818710380] [2021-05-02 18:53:09,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818710380] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:09,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622043598] [2021-05-02 18:53:09,628 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-02 18:53:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:09,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-02 18:53:09,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:09,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:09,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:09,743 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:09,745 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:09,766 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:09,768 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:09,786 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:09,788 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:09,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:09,816 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-02 18:53:09,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622043598] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:09,817 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:09,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-05-02 18:53:09,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972296262] [2021-05-02 18:53:09,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 18:53:09,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:09,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 18:53:09,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-05-02 18:53:09,818 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-02 18:53:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:09,939 INFO L93 Difference]: Finished difference Result 211 states and 269 transitions. [2021-05-02 18:53:09,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 18:53:09,939 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-02 18:53:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:09,940 INFO L225 Difference]: With dead ends: 211 [2021-05-02 18:53:09,940 INFO L226 Difference]: Without dead ends: 211 [2021-05-02 18:53:09,941 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 120.9ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-05-02 18:53:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-05-02 18:53:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2021-05-02 18:53:09,945 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-02 18:53:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 244 transitions. [2021-05-02 18:53:09,946 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 244 transitions. Word has length 34 [2021-05-02 18:53:09,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:09,946 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 244 transitions. [2021-05-02 18:53:09,946 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-02 18:53:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 244 transitions. [2021-05-02 18:53:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-02 18:53:09,947 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:09,947 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-02 18:53:10,169 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-05-02 18:53:10,169 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:10,170 INFO L82 PathProgramCache]: Analyzing trace with hash 210118746, now seen corresponding path program 2 times [2021-05-02 18:53:10,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:10,170 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139643390] [2021-05-02 18:53:10,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:10,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:10,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:10,279 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-02 18:53:10,279 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:10,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139643390] [2021-05-02 18:53:10,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139643390] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:10,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821295107] [2021-05-02 18:53:10,279 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-02 18:53:10,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 18:53:10,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:10,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2021-05-02 18:53:10,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:10,376 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:10,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:10,399 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:10,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:10,419 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:10,426 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:10,444 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:10,448 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:10,467 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:10,470 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:10,486 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:10,497 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-02 18:53:10,498 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821295107] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:10,498 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:10,498 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-05-02 18:53:10,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713401160] [2021-05-02 18:53:10,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 18:53:10,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:10,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 18:53:10,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2021-05-02 18:53:10,499 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-02 18:53:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:10,681 INFO L93 Difference]: Finished difference Result 239 states and 303 transitions. [2021-05-02 18:53:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 18:53:10,681 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-02 18:53:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:10,682 INFO L225 Difference]: With dead ends: 239 [2021-05-02 18:53:10,682 INFO L226 Difference]: Without dead ends: 239 [2021-05-02 18:53:10,683 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 140.2ms TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2021-05-02 18:53:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-05-02 18:53:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 216. [2021-05-02 18:53:10,688 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-02 18:53:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 274 transitions. [2021-05-02 18:53:10,689 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 274 transitions. Word has length 37 [2021-05-02 18:53:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:10,689 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 274 transitions. [2021-05-02 18:53:10,689 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-02 18:53:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 274 transitions. [2021-05-02 18:53:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-02 18:53:10,690 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:10,690 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-02 18:53:10,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:10,905 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:10,905 INFO L82 PathProgramCache]: Analyzing trace with hash -856307784, now seen corresponding path program 3 times [2021-05-02 18:53:10,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:10,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003661284] [2021-05-02 18:53:10,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:10,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:11,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:11,004 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-02 18:53:11,004 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:11,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003661284] [2021-05-02 18:53:11,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003661284] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:11,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315147871] [2021-05-02 18:53:11,004 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-02 18:53:11,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 18:53:11,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:11,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-02 18:53:11,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:11,161 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,192 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-02 18:53:11,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315147871] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:53:11,192 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-02 18:53:11,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2021-05-02 18:53:11,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972117495] [2021-05-02 18:53:11,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 18:53:11,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:11,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 18:53:11,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-05-02 18:53:11,194 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-02 18:53:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:11,246 INFO L93 Difference]: Finished difference Result 211 states and 263 transitions. [2021-05-02 18:53:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 18:53:11,246 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-02 18:53:11,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:11,248 INFO L225 Difference]: With dead ends: 211 [2021-05-02 18:53:11,248 INFO L226 Difference]: Without dead ends: 211 [2021-05-02 18:53:11,248 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 134.8ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-05-02 18:53:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-05-02 18:53:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2021-05-02 18:53:11,254 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-02 18:53:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 262 transitions. [2021-05-02 18:53:11,255 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 262 transitions. Word has length 40 [2021-05-02 18:53:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:11,255 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 262 transitions. [2021-05-02 18:53:11,255 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-02 18:53:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 262 transitions. [2021-05-02 18:53:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-02 18:53:11,256 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:11,256 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-02 18:53:11,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:11,465 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:11,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:11,465 INFO L82 PathProgramCache]: Analyzing trace with hash -825287977, now seen corresponding path program 1 times [2021-05-02 18:53:11,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:11,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143824378] [2021-05-02 18:53:11,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:11,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:11,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:11,573 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-02 18:53:11,573 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:11,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143824378] [2021-05-02 18:53:11,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143824378] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:11,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796864185] [2021-05-02 18:53:11,574 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-02 18:53:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:11,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-02 18:53:11,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:11,665 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,687 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,703 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,704 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,745 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,747 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,772 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,774 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,791 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:11,802 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-02 18:53:11,802 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796864185] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:11,802 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:11,802 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-05-02 18:53:11,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908662306] [2021-05-02 18:53:11,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-02 18:53:11,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:11,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-02 18:53:11,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2021-05-02 18:53:11,803 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-02 18:53:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:12,005 INFO L93 Difference]: Finished difference Result 257 states and 321 transitions. [2021-05-02 18:53:12,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 18:53:12,006 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-02 18:53:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:12,007 INFO L225 Difference]: With dead ends: 257 [2021-05-02 18:53:12,007 INFO L226 Difference]: Without dead ends: 257 [2021-05-02 18:53:12,007 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 178.5ms TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2021-05-02 18:53:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-05-02 18:53:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 234. [2021-05-02 18:53:12,012 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-02 18:53:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 292 transitions. [2021-05-02 18:53:12,013 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 292 transitions. Word has length 40 [2021-05-02 18:53:12,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:12,014 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 292 transitions. [2021-05-02 18:53:12,014 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-02 18:53:12,014 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2021-05-02 18:53:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-02 18:53:12,014 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:12,015 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-02 18:53:12,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-05-02 18:53:12,236 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:12,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:12,237 INFO L82 PathProgramCache]: Analyzing trace with hash -202872805, now seen corresponding path program 2 times [2021-05-02 18:53:12,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:12,237 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782672601] [2021-05-02 18:53:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:12,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:12,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:12,346 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-02 18:53:12,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:12,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782672601] [2021-05-02 18:53:12,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782672601] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:12,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692285186] [2021-05-02 18:53:12,347 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-02 18:53:12,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 18:53:12,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:12,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2021-05-02 18:53:12,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:12,452 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,470 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,486 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,488 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,504 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,524 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,546 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,565 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,585 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:12,595 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-02 18:53:12,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692285186] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:12,595 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:12,596 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-05-02 18:53:12,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794467644] [2021-05-02 18:53:12,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 18:53:12,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:12,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 18:53:12,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2021-05-02 18:53:12,597 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-02 18:53:12,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:12,811 INFO L93 Difference]: Finished difference Result 281 states and 351 transitions. [2021-05-02 18:53:12,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 18:53:12,811 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-02 18:53:12,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:12,812 INFO L225 Difference]: With dead ends: 281 [2021-05-02 18:53:12,812 INFO L226 Difference]: Without dead ends: 281 [2021-05-02 18:53:12,812 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 213.7ms TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2021-05-02 18:53:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-05-02 18:53:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 258. [2021-05-02 18:53:12,818 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-02 18:53:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 322 transitions. [2021-05-02 18:53:12,819 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 322 transitions. Word has length 43 [2021-05-02 18:53:12,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:12,819 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 322 transitions. [2021-05-02 18:53:12,819 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-02 18:53:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 322 transitions. [2021-05-02 18:53:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-02 18:53:12,819 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:12,820 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-02 18:53:13,033 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:13,034 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:13,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash 793699415, now seen corresponding path program 3 times [2021-05-02 18:53:13,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:13,034 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977764259] [2021-05-02 18:53:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:13,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:13,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:13,151 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-02 18:53:13,152 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:13,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977764259] [2021-05-02 18:53:13,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977764259] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:13,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896243145] [2021-05-02 18:53:13,152 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-02 18:53:13,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 18:53:13,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:13,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2021-05-02 18:53:13,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:13,291 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:13,293 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:13,355 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:13,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:13,364 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:13,395 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-02 18:53:13,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896243145] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:53:13,395 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-02 18:53:13,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2021-05-02 18:53:13,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503790162] [2021-05-02 18:53:13,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 18:53:13,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:13,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 18:53:13,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2021-05-02 18:53:13,397 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-02 18:53:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:13,499 INFO L93 Difference]: Finished difference Result 339 states and 417 transitions. [2021-05-02 18:53:13,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 18:53:13,500 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-02 18:53:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:13,501 INFO L225 Difference]: With dead ends: 339 [2021-05-02 18:53:13,501 INFO L226 Difference]: Without dead ends: 339 [2021-05-02 18:53:13,502 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 196.4ms TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-05-02 18:53:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-05-02 18:53:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2021-05-02 18:53:13,507 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-02 18:53:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 413 transitions. [2021-05-02 18:53:13,509 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 413 transitions. Word has length 46 [2021-05-02 18:53:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:13,509 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 413 transitions. [2021-05-02 18:53:13,509 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-02 18:53:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 413 transitions. [2021-05-02 18:53:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-02 18:53:13,510 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:13,510 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-02 18:53:13,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-05-02 18:53:13,729 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:13,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:13,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1458701912, now seen corresponding path program 1 times [2021-05-02 18:53:13,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:13,729 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225949272] [2021-05-02 18:53:13,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:13,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:13,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:13,855 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-02 18:53:13,855 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:13,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225949272] [2021-05-02 18:53:13,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225949272] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:13,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154702911] [2021-05-02 18:53:13,856 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-02 18:53:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:13,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-02 18:53:13,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:13,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:13,955 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:13,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:13,975 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:13,993 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:13,994 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:14,013 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:14,015 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:14,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:14,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:14,058 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:14,059 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:14,081 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:14,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:14,112 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:14,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:14,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:14,146 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-02 18:53:14,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154702911] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:14,146 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:14,146 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2021-05-02 18:53:14,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566208033] [2021-05-02 18:53:14,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-02 18:53:14,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-02 18:53:14,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2021-05-02 18:53:14,148 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-02 18:53:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:14,755 INFO L93 Difference]: Finished difference Result 496 states and 611 transitions. [2021-05-02 18:53:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 18:53:14,756 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-02 18:53:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:14,759 INFO L225 Difference]: With dead ends: 496 [2021-05-02 18:53:14,759 INFO L226 Difference]: Without dead ends: 496 [2021-05-02 18:53:14,760 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 484.3ms TimeCoverageRelationStatistics Valid=431, Invalid=1209, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 18:53:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-05-02 18:53:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 451. [2021-05-02 18:53:14,768 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-02 18:53:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 558 transitions. [2021-05-02 18:53:14,770 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 558 transitions. Word has length 46 [2021-05-02 18:53:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:14,770 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 558 transitions. [2021-05-02 18:53:14,770 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-02 18:53:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 558 transitions. [2021-05-02 18:53:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-02 18:53:14,771 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:14,771 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-02 18:53:14,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-05-02 18:53:14,981 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:14,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1517654139, now seen corresponding path program 2 times [2021-05-02 18:53:14,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:14,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260146055] [2021-05-02 18:53:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:15,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:15,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:15,132 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-02 18:53:15,132 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:15,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260146055] [2021-05-02 18:53:15,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260146055] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:15,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870870642] [2021-05-02 18:53:15,132 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-02 18:53:15,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 18:53:15,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:15,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-02 18:53:15,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:15,224 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,241 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,243 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,260 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,279 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,296 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,326 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,327 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,348 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,350 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,374 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,375 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,396 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,429 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:15,440 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-02 18:53:15,441 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870870642] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:15,441 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:15,441 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-02 18:53:15,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689875145] [2021-05-02 18:53:15,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 18:53:15,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:15,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 18:53:15,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2021-05-02 18:53:15,442 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-02 18:53:15,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:15,945 INFO L93 Difference]: Finished difference Result 652 states and 809 transitions. [2021-05-02 18:53:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-02 18:53:15,945 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-02 18:53:15,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:15,950 INFO L225 Difference]: With dead ends: 652 [2021-05-02 18:53:15,950 INFO L226 Difference]: Without dead ends: 652 [2021-05-02 18:53:15,951 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 402.4ms TimeCoverageRelationStatistics Valid=376, Invalid=1030, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 18:53:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2021-05-02 18:53:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 458. [2021-05-02 18:53:15,965 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-02 18:53:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 572 transitions. [2021-05-02 18:53:15,968 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 572 transitions. Word has length 49 [2021-05-02 18:53:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:15,968 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 572 transitions. [2021-05-02 18:53:15,968 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-02 18:53:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 572 transitions. [2021-05-02 18:53:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-02 18:53:15,969 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:15,969 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-02 18:53:16,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-05-02 18:53:16,185 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1433960443, now seen corresponding path program 1 times [2021-05-02 18:53:16,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:16,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205950374] [2021-05-02 18:53:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:16,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:16,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:16,249 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-02 18:53:16,249 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:16,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205950374] [2021-05-02 18:53:16,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205950374] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:53:16,249 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:53:16,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 18:53:16,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345492595] [2021-05-02 18:53:16,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 18:53:16,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:16,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 18:53:16,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 18:53:16,250 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-02 18:53:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:16,375 INFO L93 Difference]: Finished difference Result 624 states and 784 transitions. [2021-05-02 18:53:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 18:53:16,376 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-02 18:53:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:16,380 INFO L225 Difference]: With dead ends: 624 [2021-05-02 18:53:16,380 INFO L226 Difference]: Without dead ends: 624 [2021-05-02 18:53:16,381 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 67.4ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-05-02 18:53:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-05-02 18:53:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 493. [2021-05-02 18:53:16,392 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-02 18:53:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 618 transitions. [2021-05-02 18:53:16,395 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 618 transitions. Word has length 49 [2021-05-02 18:53:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:16,395 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 618 transitions. [2021-05-02 18:53:16,396 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-02 18:53:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 618 transitions. [2021-05-02 18:53:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-02 18:53:16,396 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:16,396 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-02 18:53:16,396 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 18:53:16,397 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:16,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:16,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1121824632, now seen corresponding path program 3 times [2021-05-02 18:53:16,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:16,397 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224601265] [2021-05-02 18:53:16,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:16,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:16,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:16,553 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-02 18:53:16,553 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:16,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224601265] [2021-05-02 18:53:16,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224601265] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:16,554 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599916862] [2021-05-02 18:53:16,554 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-02 18:53:16,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 18:53:16,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:16,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-02 18:53:16,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:16,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:16,755 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:16,797 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:16,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:16,803 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:16,838 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-02 18:53:16,838 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599916862] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:53:16,838 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-02 18:53:16,838 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2021-05-02 18:53:16,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157434797] [2021-05-02 18:53:16,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 18:53:16,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 18:53:16,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-05-02 18:53:16,840 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-02 18:53:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:16,929 INFO L93 Difference]: Finished difference Result 502 states and 627 transitions. [2021-05-02 18:53:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 18:53:16,929 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-02 18:53:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:16,932 INFO L225 Difference]: With dead ends: 502 [2021-05-02 18:53:16,932 INFO L226 Difference]: Without dead ends: 502 [2021-05-02 18:53:16,932 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 272.6ms TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2021-05-02 18:53:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-05-02 18:53:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 493. [2021-05-02 18:53:16,942 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-02 18:53:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 618 transitions. [2021-05-02 18:53:16,943 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 618 transitions. Word has length 52 [2021-05-02 18:53:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:16,944 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 618 transitions. [2021-05-02 18:53:16,944 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-02 18:53:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 618 transitions. [2021-05-02 18:53:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-02 18:53:16,945 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:16,945 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-02 18:53:17,163 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-05-02 18:53:17,163 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:17,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:17,164 INFO L82 PathProgramCache]: Analyzing trace with hash 225679135, now seen corresponding path program 1 times [2021-05-02 18:53:17,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:17,164 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76532164] [2021-05-02 18:53:17,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:17,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:17,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:17,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-05-02 18:53:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:17,310 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-02 18:53:17,310 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:17,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76532164] [2021-05-02 18:53:17,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76532164] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:17,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379745857] [2021-05-02 18:53:17,311 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-02 18:53:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:17,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2021-05-02 18:53:17,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:17,402 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,419 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,436 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,438 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,455 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,472 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,490 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,501 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,524 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,551 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,553 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,576 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,578 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:17,647 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-02 18:53:17,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379745857] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:17,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:17,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-05-02 18:53:17,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216296864] [2021-05-02 18:53:17,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 18:53:17,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:17,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 18:53:17,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2021-05-02 18:53:17,649 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-02 18:53:17,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:17,921 INFO L93 Difference]: Finished difference Result 559 states and 696 transitions. [2021-05-02 18:53:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 18:53:17,921 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-02 18:53:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:17,924 INFO L225 Difference]: With dead ends: 559 [2021-05-02 18:53:17,924 INFO L226 Difference]: Without dead ends: 559 [2021-05-02 18:53:17,924 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 238.5ms TimeCoverageRelationStatistics Valid=214, Invalid=386, Unknown=0, NotChecked=0, Total=600 [2021-05-02 18:53:17,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-05-02 18:53:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 524. [2021-05-02 18:53:17,936 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-02 18:53:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 651 transitions. [2021-05-02 18:53:17,938 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 651 transitions. Word has length 87 [2021-05-02 18:53:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:17,938 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 651 transitions. [2021-05-02 18:53:17,938 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-02 18:53:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 651 transitions. [2021-05-02 18:53:17,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-02 18:53:17,942 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:17,942 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-02 18:53:18,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:18,157 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:18,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:18,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1359158039, now seen corresponding path program 2 times [2021-05-02 18:53:18,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:18,158 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103864577] [2021-05-02 18:53:18,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:18,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:18,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:18,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-02 18:53:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:18,323 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-02 18:53:18,324 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:18,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103864577] [2021-05-02 18:53:18,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103864577] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:18,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143243313] [2021-05-02 18:53:18,324 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-02 18:53:18,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 18:53:18,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:18,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-02 18:53:18,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:18,433 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,434 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,449 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,484 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,501 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,502 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,522 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,541 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,562 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,563 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,585 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,610 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,632 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:18,686 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-02 18:53:18,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143243313] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:18,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:18,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-02 18:53:18,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329717772] [2021-05-02 18:53:18,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 18:53:18,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:18,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 18:53:18,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2021-05-02 18:53:18,689 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-02 18:53:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:18,962 INFO L93 Difference]: Finished difference Result 612 states and 759 transitions. [2021-05-02 18:53:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 18:53:18,963 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-02 18:53:18,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:18,966 INFO L225 Difference]: With dead ends: 612 [2021-05-02 18:53:18,966 INFO L226 Difference]: Without dead ends: 612 [2021-05-02 18:53:18,966 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 267.8ms TimeCoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2021-05-02 18:53:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-05-02 18:53:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 569. [2021-05-02 18:53:18,997 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-02 18:53:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 706 transitions. [2021-05-02 18:53:19,000 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 706 transitions. Word has length 93 [2021-05-02 18:53:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:19,000 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 706 transitions. [2021-05-02 18:53:19,000 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-02 18:53:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 706 transitions. [2021-05-02 18:53:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-02 18:53:19,001 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:19,001 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-02 18:53:19,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-05-02 18:53:19,202 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:19,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:19,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1567764767, now seen corresponding path program 3 times [2021-05-02 18:53:19,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:19,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343534851] [2021-05-02 18:53:19,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:19,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:19,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:19,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-02 18:53:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:19,378 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-02 18:53:19,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:19,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343534851] [2021-05-02 18:53:19,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343534851] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:19,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15392031] [2021-05-02 18:53:19,378 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-02 18:53:19,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 18:53:19,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:19,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-02 18:53:19,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:19,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:19,608 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:19,677 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:19,684 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:19,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:19,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:19,726 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-02 18:53:19,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15392031] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:19,726 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:19,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 24 [2021-05-02 18:53:19,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853814233] [2021-05-02 18:53:19,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 18:53:19,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:19,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 18:53:19,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-05-02 18:53:19,728 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-02 18:53:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:21,137 INFO L93 Difference]: Finished difference Result 973 states and 1204 transitions. [2021-05-02 18:53:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-02 18:53:21,137 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-02 18:53:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:21,140 INFO L225 Difference]: With dead ends: 973 [2021-05-02 18:53:21,140 INFO L226 Difference]: Without dead ends: 973 [2021-05-02 18:53:21,142 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 1120.0ms TimeCoverageRelationStatistics Valid=944, Invalid=3612, Unknown=0, NotChecked=0, Total=4556 [2021-05-02 18:53:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-05-02 18:53:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 916. [2021-05-02 18:53:21,154 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-02 18:53:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1137 transitions. [2021-05-02 18:53:21,157 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1137 transitions. Word has length 99 [2021-05-02 18:53:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:21,157 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1137 transitions. [2021-05-02 18:53:21,157 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-02 18:53:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1137 transitions. [2021-05-02 18:53:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-02 18:53:21,158 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:21,159 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-02 18:53:21,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:21,373 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:21,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1915685814, now seen corresponding path program 1 times [2021-05-02 18:53:21,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:21,373 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175294758] [2021-05-02 18:53:21,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:21,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:21,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:21,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-05-02 18:53:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:21,588 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-02 18:53:21,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:21,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175294758] [2021-05-02 18:53:21,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175294758] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:21,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122540056] [2021-05-02 18:53:21,588 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-02 18:53:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:21,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 15 conjunts are in the unsatisfiable core [2021-05-02 18:53:21,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:21,684 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,686 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,703 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,718 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,720 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,736 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,737 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,755 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,756 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,775 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,776 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,795 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,796 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,817 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,840 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,863 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,865 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,891 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,893 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,916 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,918 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:21,996 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-02 18:53:21,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122540056] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:21,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:21,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2021-05-02 18:53:21,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94612346] [2021-05-02 18:53:21,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 18:53:21,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:21,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 18:53:21,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=540, Unknown=0, NotChecked=0, Total=870 [2021-05-02 18:53:21,998 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-02 18:53:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:22,292 INFO L93 Difference]: Finished difference Result 1026 states and 1272 transitions. [2021-05-02 18:53:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-02 18:53:22,292 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-02 18:53:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:22,295 INFO L225 Difference]: With dead ends: 1026 [2021-05-02 18:53:22,296 INFO L226 Difference]: Without dead ends: 1026 [2021-05-02 18:53:22,296 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 351.3ms TimeCoverageRelationStatistics Valid=334, Invalid=596, Unknown=0, NotChecked=0, Total=930 [2021-05-02 18:53:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2021-05-02 18:53:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 964. [2021-05-02 18:53:22,313 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-02 18:53:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1195 transitions. [2021-05-02 18:53:22,316 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1195 transitions. Word has length 105 [2021-05-02 18:53:22,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:22,316 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1195 transitions. [2021-05-02 18:53:22,316 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-02 18:53:22,316 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1195 transitions. [2021-05-02 18:53:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-02 18:53:22,317 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:22,318 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-02 18:53:22,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-05-02 18:53:22,533 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash 668267967, now seen corresponding path program 2 times [2021-05-02 18:53:22,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:22,533 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304694174] [2021-05-02 18:53:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:22,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:22,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:22,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-02 18:53:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:22,761 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-02 18:53:22,761 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:22,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304694174] [2021-05-02 18:53:22,761 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304694174] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:22,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634832574] [2021-05-02 18:53:22,761 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-02 18:53:22,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 18:53:22,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:22,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjunts are in the unsatisfiable core [2021-05-02 18:53:22,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:22,862 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,864 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,879 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,895 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,896 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,912 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,929 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,946 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,947 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,983 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:22,984 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:23,002 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:23,003 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:23,025 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:23,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:23,053 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:23,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:23,082 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:23,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:23,111 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:23,112 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:23,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:23,204 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-02 18:53:23,205 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634832574] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:23,205 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:23,205 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-05-02 18:53:23,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537348845] [2021-05-02 18:53:23,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 18:53:23,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:23,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 18:53:23,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=616, Unknown=0, NotChecked=0, Total=992 [2021-05-02 18:53:23,206 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-02 18:53:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:23,425 INFO L93 Difference]: Finished difference Result 1097 states and 1358 transitions. [2021-05-02 18:53:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 18:53:23,426 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-02 18:53:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:23,430 INFO L225 Difference]: With dead ends: 1097 [2021-05-02 18:53:23,430 INFO L226 Difference]: Without dead ends: 1097 [2021-05-02 18:53:23,430 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 366.3ms TimeCoverageRelationStatistics Valid=380, Invalid=676, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 18:53:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2021-05-02 18:53:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1033. [2021-05-02 18:53:23,443 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-02 18:53:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1279 transitions. [2021-05-02 18:53:23,446 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1279 transitions. Word has length 111 [2021-05-02 18:53:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:23,446 INFO L480 AbstractCegarLoop]: Abstraction has 1033 states and 1279 transitions. [2021-05-02 18:53:23,446 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-02 18:53:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1279 transitions. [2021-05-02 18:53:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-05-02 18:53:23,448 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:23,448 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-02 18:53:23,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-05-02 18:53:23,661 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:23,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:23,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1949635370, now seen corresponding path program 3 times [2021-05-02 18:53:23,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:23,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204899039] [2021-05-02 18:53:23,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:23,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:23,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:23,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-02 18:53:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:23,906 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-02 18:53:23,906 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:23,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204899039] [2021-05-02 18:53:23,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204899039] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:23,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598906995] [2021-05-02 18:53:23,906 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-02 18:53:23,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 18:53:23,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:23,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-02 18:53:23,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:24,176 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:24,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:24,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:24,240 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:24,243 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 42 proven. 623 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2021-05-02 18:53:24,280 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598906995] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:24,280 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:24,280 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 27 [2021-05-02 18:53:24,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401824882] [2021-05-02 18:53:24,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-02 18:53:24,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:24,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-02 18:53:24,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-05-02 18:53:24,282 INFO L87 Difference]: Start difference. First operand 1033 states and 1279 transitions. Second operand has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 25 states have internal predecessors, (100), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 18:53:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:25,857 INFO L93 Difference]: Finished difference Result 1317 states and 1613 transitions. [2021-05-02 18:53:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-02 18:53:25,857 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 25 states have internal predecessors, (100), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 117 [2021-05-02 18:53:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:25,864 INFO L225 Difference]: With dead ends: 1317 [2021-05-02 18:53:25,864 INFO L226 Difference]: Without dead ends: 1317 [2021-05-02 18:53:25,866 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 1337.0ms TimeCoverageRelationStatistics Valid=1364, Invalid=4956, Unknown=0, NotChecked=0, Total=6320 [2021-05-02 18:53:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2021-05-02 18:53:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1138. [2021-05-02 18:53:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1099 states have (on average 1.2383985441310281) internal successors, (1361), 1105 states have internal predecessors, (1361), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 18:53:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1408 transitions. [2021-05-02 18:53:25,896 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1408 transitions. Word has length 117 [2021-05-02 18:53:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:25,896 INFO L480 AbstractCegarLoop]: Abstraction has 1138 states and 1408 transitions. [2021-05-02 18:53:25,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 25 states have internal predecessors, (100), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 18:53:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1408 transitions. [2021-05-02 18:53:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-02 18:53:25,898 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:25,898 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 28, 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-02 18:53:26,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-05-02 18:53:26,113 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:26,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:26,113 INFO L82 PathProgramCache]: Analyzing trace with hash -181278978, now seen corresponding path program 4 times [2021-05-02 18:53:26,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:26,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511160173] [2021-05-02 18:53:26,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:26,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:26,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:26,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-05-02 18:53:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 709 proven. 330 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2021-05-02 18:53:26,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:26,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511160173] [2021-05-02 18:53:26,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511160173] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:26,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838789514] [2021-05-02 18:53:26,345 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-02 18:53:26,424 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 18:53:26,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:26,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 53 conjunts are in the unsatisfiable core [2021-05-02 18:53:26,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:26,479 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,502 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,504 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,552 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,553 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,578 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,579 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,633 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,636 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,661 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,690 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,751 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,753 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,796 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,798 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,874 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:26,907 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,011 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,021 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,052 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,094 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,129 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,160 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,162 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,190 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,191 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,221 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,222 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,252 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,254 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,284 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,285 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,316 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,320 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,359 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,361 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,394 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,395 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,428 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,472 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,507 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,609 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 287 proven. 1087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:53:27,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838789514] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:27,663 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:27,663 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 41] total 59 [2021-05-02 18:53:27,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393098243] [2021-05-02 18:53:27,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-02 18:53:27,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:27,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-02 18:53:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=2839, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 18:53:27,665 INFO L87 Difference]: Start difference. First operand 1138 states and 1408 transitions. Second operand has 59 states, 59 states have (on average 3.0847457627118646) internal successors, (182), 57 states have internal predecessors, (182), 5 states have call successors, (10), 6 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-02 18:53:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:29,656 INFO L93 Difference]: Finished difference Result 1362 states and 1674 transitions. [2021-05-02 18:53:29,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-02 18:53:29,656 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 3.0847457627118646) internal successors, (182), 57 states have internal predecessors, (182), 5 states have call successors, (10), 6 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 123 [2021-05-02 18:53:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:29,660 INFO L225 Difference]: With dead ends: 1362 [2021-05-02 18:53:29,660 INFO L226 Difference]: Without dead ends: 1362 [2021-05-02 18:53:29,662 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3833 ImplicationChecksByTransitivity, 2181.0ms TimeCoverageRelationStatistics Valid=2042, Invalid=9730, Unknown=0, NotChecked=0, Total=11772 [2021-05-02 18:53:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2021-05-02 18:53:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1167. [2021-05-02 18:53:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1129 states have (on average 1.237378210806023) internal successors, (1397), 1135 states have internal predecessors, (1397), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (22), 16 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-02 18:53:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1442 transitions. [2021-05-02 18:53:29,678 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1442 transitions. Word has length 123 [2021-05-02 18:53:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:29,678 INFO L480 AbstractCegarLoop]: Abstraction has 1167 states and 1442 transitions. [2021-05-02 18:53:29,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 3.0847457627118646) internal successors, (182), 57 states have internal predecessors, (182), 5 states have call successors, (10), 6 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-02 18:53:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1442 transitions. [2021-05-02 18:53:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-05-02 18:53:29,680 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:29,680 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-02 18:53:29,901 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:29,902 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1219098231, now seen corresponding path program 1 times [2021-05-02 18:53:29,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:29,902 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549725315] [2021-05-02 18:53:29,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:30,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:30,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:30,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-05-02 18:53:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:30,141 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-02 18:53:30,141 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:30,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549725315] [2021-05-02 18:53:30,141 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549725315] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:30,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039134557] [2021-05-02 18:53:30,141 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-02 18:53:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:30,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2021-05-02 18:53:30,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:30,244 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,245 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,263 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,279 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,280 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,298 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,317 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,318 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,360 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,361 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,379 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,398 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,400 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,420 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,445 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,468 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,494 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,517 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,518 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,610 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:30,670 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-02 18:53:30,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039134557] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:30,670 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:30,670 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2021-05-02 18:53:30,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172242124] [2021-05-02 18:53:30,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-02 18:53:30,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:30,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-02 18:53:30,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=981, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 18:53:30,672 INFO L87 Difference]: Start difference. First operand 1167 states and 1442 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-02 18:53:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:31,489 INFO L93 Difference]: Finished difference Result 1526 states and 1888 transitions. [2021-05-02 18:53:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-02 18:53:31,493 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-02 18:53:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:31,496 INFO L225 Difference]: With dead ends: 1526 [2021-05-02 18:53:31,496 INFO L226 Difference]: Without dead ends: 1526 [2021-05-02 18:53:31,497 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 865.6ms TimeCoverageRelationStatistics Valid=1159, Invalid=3001, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 18:53:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2021-05-02 18:53:31,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1156. [2021-05-02 18:53:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1118 states have (on average 1.2531305903398926) internal successors, (1401), 1124 states have internal predecessors, (1401), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (22), 16 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-02 18:53:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1446 transitions. [2021-05-02 18:53:31,513 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1446 transitions. Word has length 129 [2021-05-02 18:53:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:31,513 INFO L480 AbstractCegarLoop]: Abstraction has 1156 states and 1446 transitions. [2021-05-02 18:53:31,513 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-02 18:53:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1446 transitions. [2021-05-02 18:53:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-02 18:53:31,515 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:31,515 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-02 18:53:31,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-05-02 18:53:31,729 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:31,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:31,729 INFO L82 PathProgramCache]: Analyzing trace with hash -376627745, now seen corresponding path program 2 times [2021-05-02 18:53:31,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:31,729 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241949096] [2021-05-02 18:53:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:31,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:31,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:31,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-02 18:53:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:31,994 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-02 18:53:31,994 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:31,994 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241949096] [2021-05-02 18:53:31,995 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241949096] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:31,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481206899] [2021-05-02 18:53:31,995 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 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-02 18:53:32,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 18:53:32,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:32,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-02 18:53:32,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:32,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,141 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,173 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,191 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,192 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,209 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,228 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,229 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,247 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,248 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,268 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,288 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,311 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,312 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,371 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,433 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,467 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,496 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:32,635 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-02 18:53:32,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481206899] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:32,635 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:32,635 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2021-05-02 18:53:32,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575952310] [2021-05-02 18:53:32,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 18:53:32,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 18:53:32,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=1179, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 18:53:32,637 INFO L87 Difference]: Start difference. First operand 1156 states and 1446 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-02 18:53:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:33,384 INFO L93 Difference]: Finished difference Result 1595 states and 2006 transitions. [2021-05-02 18:53:33,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 18:53:33,385 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-02 18:53:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:33,388 INFO L225 Difference]: With dead ends: 1595 [2021-05-02 18:53:33,388 INFO L226 Difference]: Without dead ends: 1595 [2021-05-02 18:53:33,389 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 816.3ms TimeCoverageRelationStatistics Valid=1088, Invalid=2694, Unknown=0, NotChecked=0, Total=3782 [2021-05-02 18:53:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2021-05-02 18:53:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1168. [2021-05-02 18:53:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1130 states have (on average 1.261061946902655) internal successors, (1425), 1136 states have internal predecessors, (1425), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (22), 16 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-02 18:53:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1470 transitions. [2021-05-02 18:53:33,406 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1470 transitions. Word has length 135 [2021-05-02 18:53:33,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:33,406 INFO L480 AbstractCegarLoop]: Abstraction has 1168 states and 1470 transitions. [2021-05-02 18:53:33,407 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-02 18:53:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1470 transitions. [2021-05-02 18:53:33,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-02 18:53:33,408 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:33,408 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 34, 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-02 18:53:33,630 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:33,631 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:33,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:33,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1208899744, now seen corresponding path program 1 times [2021-05-02 18:53:33,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:33,631 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218938267] [2021-05-02 18:53:33,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:33,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:33,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:33,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-02 18:53:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 3 proven. 907 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2021-05-02 18:53:33,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:33,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218938267] [2021-05-02 18:53:33,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218938267] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:33,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019695258] [2021-05-02 18:53:33,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-02 18:53:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:33,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 20 conjunts are in the unsatisfiable core [2021-05-02 18:53:33,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:33,805 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,807 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,822 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,838 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,854 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,872 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,891 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,892 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,910 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,932 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,976 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:33,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,000 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,002 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,025 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,053 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,054 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,081 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,104 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,106 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,129 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,155 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 903 proven. 425 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2021-05-02 18:53:34,241 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019695258] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:34,241 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:34,241 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21] total 25 [2021-05-02 18:53:34,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312788861] [2021-05-02 18:53:34,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 18:53:34,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 18:53:34,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=378, Unknown=0, NotChecked=0, Total=600 [2021-05-02 18:53:34,242 INFO L87 Difference]: Start difference. First operand 1168 states and 1470 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 24 states have internal predecessors, (101), 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-02 18:53:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:35,514 INFO L93 Difference]: Finished difference Result 1898 states and 2371 transitions. [2021-05-02 18:53:35,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-05-02 18:53:35,515 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 24 states have internal predecessors, (101), 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 135 [2021-05-02 18:53:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:35,520 INFO L225 Difference]: With dead ends: 1898 [2021-05-02 18:53:35,520 INFO L226 Difference]: Without dead ends: 1898 [2021-05-02 18:53:35,521 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 1305.3ms TimeCoverageRelationStatistics Valid=2083, Invalid=4559, Unknown=0, NotChecked=0, Total=6642 [2021-05-02 18:53:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2021-05-02 18:53:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1274. [2021-05-02 18:53:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1235 states have (on average 1.2558704453441296) internal successors, (1551), 1241 states have internal predecessors, (1551), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 18:53:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1598 transitions. [2021-05-02 18:53:35,540 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1598 transitions. Word has length 135 [2021-05-02 18:53:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:35,540 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 1598 transitions. [2021-05-02 18:53:35,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 24 states have internal predecessors, (101), 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-02 18:53:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1598 transitions. [2021-05-02 18:53:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-05-02 18:53:35,542 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:35,542 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-02 18:53:35,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-05-02 18:53:35,764 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:35,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:35,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1476745417, now seen corresponding path program 3 times [2021-05-02 18:53:35,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:35,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447784733] [2021-05-02 18:53:35,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:36,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:36,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:36,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-05-02 18:53:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:36,034 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-02 18:53:36,034 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:36,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447784733] [2021-05-02 18:53:36,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447784733] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:36,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807745292] [2021-05-02 18:53:36,034 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 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-02 18:53:36,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-05-02 18:53:36,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:36,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 31 conjunts are in the unsatisfiable core [2021-05-02 18:53:36,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 0 proven. 1017 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2021-05-02 18:53:36,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807745292] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:36,485 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:36,485 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11] total 33 [2021-05-02 18:53:36,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737575837] [2021-05-02 18:53:36,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-02 18:53:36,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-02 18:53:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=826, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 18:53:36,486 INFO L87 Difference]: Start difference. First operand 1274 states and 1598 transitions. Second operand has 33 states, 33 states have (on average 3.393939393939394) internal successors, (112), 31 states have internal predecessors, (112), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-05-02 18:53:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:39,779 INFO L93 Difference]: Finished difference Result 1812 states and 2270 transitions. [2021-05-02 18:53:39,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2021-05-02 18:53:39,779 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.393939393939394) internal successors, (112), 31 states have internal predecessors, (112), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 141 [2021-05-02 18:53:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:39,783 INFO L225 Difference]: With dead ends: 1812 [2021-05-02 18:53:39,783 INFO L226 Difference]: Without dead ends: 1812 [2021-05-02 18:53:39,785 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5488 ImplicationChecksByTransitivity, 2861.2ms TimeCoverageRelationStatistics Valid=3393, Invalid=14697, Unknown=0, NotChecked=0, Total=18090 [2021-05-02 18:53:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2021-05-02 18:53:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1351. [2021-05-02 18:53:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1311 states have (on average 1.2540045766590389) internal successors, (1644), 1317 states have internal predecessors, (1644), 25 states have call successors, (25), 15 states have call predecessors, (25), 14 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2021-05-02 18:53:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1693 transitions. [2021-05-02 18:53:39,802 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1693 transitions. Word has length 141 [2021-05-02 18:53:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:39,802 INFO L480 AbstractCegarLoop]: Abstraction has 1351 states and 1693 transitions. [2021-05-02 18:53:39,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 3.393939393939394) internal successors, (112), 31 states have internal predecessors, (112), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-05-02 18:53:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1693 transitions. [2021-05-02 18:53:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-05-02 18:53:39,804 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:39,804 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-02 18:53:40,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:40,026 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:40,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:40,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2074253891, now seen corresponding path program 1 times [2021-05-02 18:53:40,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:40,026 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421725891] [2021-05-02 18:53:40,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:40,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:40,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:40,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-05-02 18:53:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:40,311 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-02 18:53:40,311 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:40,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421725891] [2021-05-02 18:53:40,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421725891] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:40,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632713801] [2021-05-02 18:53:40,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-02 18:53:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:40,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-02 18:53:40,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:40,420 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,436 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,452 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,468 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,485 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,486 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,502 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,518 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,519 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,535 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,536 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,554 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,555 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,573 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,608 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,609 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,654 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,656 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,688 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,689 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,712 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,736 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,785 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,811 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,812 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,835 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:40,906 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-02 18:53:40,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632713801] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:40,906 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:40,907 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2021-05-02 18:53:40,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675002698] [2021-05-02 18:53:40,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 18:53:40,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:40,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 18:53:40,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1071, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 18:53:40,908 INFO L87 Difference]: Start difference. First operand 1351 states and 1693 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-02 18:53:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:41,281 INFO L93 Difference]: Finished difference Result 1456 states and 1818 transitions. [2021-05-02 18:53:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-02 18:53:41,281 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-02 18:53:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:41,284 INFO L225 Difference]: With dead ends: 1456 [2021-05-02 18:53:41,284 INFO L226 Difference]: Without dead ends: 1456 [2021-05-02 18:53:41,285 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 540.5ms TimeCoverageRelationStatistics Valid=655, Invalid=1151, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 18:53:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2021-05-02 18:53:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1400. [2021-05-02 18:53:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1360 states have (on average 1.2470588235294118) internal successors, (1696), 1366 states have internal predecessors, (1696), 25 states have call successors, (25), 15 states have call predecessors, (25), 14 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2021-05-02 18:53:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1745 transitions. [2021-05-02 18:53:41,299 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1745 transitions. Word has length 144 [2021-05-02 18:53:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:41,300 INFO L480 AbstractCegarLoop]: Abstraction has 1400 states and 1745 transitions. [2021-05-02 18:53:41,300 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-02 18:53:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1745 transitions. [2021-05-02 18:53:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-05-02 18:53:41,302 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:41,302 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 36, 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-02 18:53:41,516 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-05-02 18:53:41,517 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:41,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash -135518722, now seen corresponding path program 5 times [2021-05-02 18:53:41,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:41,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699259120] [2021-05-02 18:53:41,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:41,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:41,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:41,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-05-02 18:53:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2194 backedges. 1125 proven. 532 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2021-05-02 18:53:41,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:41,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699259120] [2021-05-02 18:53:41,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699259120] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:41,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464155432] [2021-05-02 18:53:41,795 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 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-02 18:53:41,847 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2021-05-02 18:53:41,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:41,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-02 18:53:41,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:41,948 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:41,949 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2194 backedges. 1212 proven. 2 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2021-05-02 18:53:42,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464155432] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:42,080 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:42,080 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 6] total 28 [2021-05-02 18:53:42,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987680970] [2021-05-02 18:53:42,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 18:53:42,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:42,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 18:53:42,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=510, Unknown=0, NotChecked=0, Total=756 [2021-05-02 18:53:42,081 INFO L87 Difference]: Start difference. First operand 1400 states and 1745 transitions. Second operand has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 27 states have internal predecessors, (100), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 18:53:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:44,164 INFO L93 Difference]: Finished difference Result 1744 states and 2088 transitions. [2021-05-02 18:53:44,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2021-05-02 18:53:44,164 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 27 states have internal predecessors, (100), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 147 [2021-05-02 18:53:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:44,169 INFO L225 Difference]: With dead ends: 1744 [2021-05-02 18:53:44,169 INFO L226 Difference]: Without dead ends: 1738 [2021-05-02 18:53:44,170 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5622 ImplicationChecksByTransitivity, 1968.7ms TimeCoverageRelationStatistics Valid=3627, Invalid=11625, Unknown=0, NotChecked=0, Total=15252 [2021-05-02 18:53:44,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2021-05-02 18:53:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1395. [2021-05-02 18:53:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1356 states have (on average 1.2396755162241888) internal successors, (1681), 1362 states have internal predecessors, (1681), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 18:53:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1728 transitions. [2021-05-02 18:53:44,188 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1728 transitions. Word has length 147 [2021-05-02 18:53:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:44,189 INFO L480 AbstractCegarLoop]: Abstraction has 1395 states and 1728 transitions. [2021-05-02 18:53:44,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 27 states have internal predecessors, (100), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 18:53:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1728 transitions. [2021-05-02 18:53:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-02 18:53:44,191 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:44,191 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 39, 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-02 18:53:44,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-05-02 18:53:44,405 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:44,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:44,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1586608682, now seen corresponding path program 2 times [2021-05-02 18:53:44,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:44,405 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123190263] [2021-05-02 18:53:44,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:45,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:45,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:45,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:53:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 588 proven. 1841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:53:45,206 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:45,206 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123190263] [2021-05-02 18:53:45,206 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123190263] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:45,206 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521352201] [2021-05-02 18:53:45,206 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 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-02 18:53:45,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 18:53:45,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:45,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 23 conjunts are in the unsatisfiable core [2021-05-02 18:53:45,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:45,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,448 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,477 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,478 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,504 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,560 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,562 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,591 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,625 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,661 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,689 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,690 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,718 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,747 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,748 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,778 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,809 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,810 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,841 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,842 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,888 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,974 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:45,975 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:46,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:46,010 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:46,045 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:46,046 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:46,081 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 87 proven. 1752 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2021-05-02 18:53:46,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521352201] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:46,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:46,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 24] total 65 [2021-05-02 18:53:46,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966706853] [2021-05-02 18:53:46,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-02 18:53:46,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:46,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-02 18:53:46,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=3231, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 18:53:46,096 INFO L87 Difference]: Start difference. First operand 1395 states and 1728 transitions. Second operand has 65 states, 65 states have (on average 3.4307692307692306) internal successors, (223), 64 states have internal predecessors, (223), 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-02 18:53:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:49,102 INFO L93 Difference]: Finished difference Result 1722 states and 1909 transitions. [2021-05-02 18:53:49,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-02 18:53:49,102 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.4307692307692306) internal successors, (223), 64 states have internal predecessors, (223), 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 153 [2021-05-02 18:53:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:49,106 INFO L225 Difference]: With dead ends: 1722 [2021-05-02 18:53:49,106 INFO L226 Difference]: Without dead ends: 1722 [2021-05-02 18:53:49,108 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4268 ImplicationChecksByTransitivity, 2534.7ms TimeCoverageRelationStatistics Valid=3112, Invalid=13144, Unknown=0, NotChecked=0, Total=16256 [2021-05-02 18:53:49,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2021-05-02 18:53:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1703. [2021-05-02 18:53:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1649 states have (on average 1.1097634930260765) internal successors, (1830), 1658 states have internal predecessors, (1830), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2021-05-02 18:53:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 1891 transitions. [2021-05-02 18:53:49,125 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 1891 transitions. Word has length 153 [2021-05-02 18:53:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:49,126 INFO L480 AbstractCegarLoop]: Abstraction has 1703 states and 1891 transitions. [2021-05-02 18:53:49,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 65 states have (on average 3.4307692307692306) internal successors, (223), 64 states have internal predecessors, (223), 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-02 18:53:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 1891 transitions. [2021-05-02 18:53:49,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-05-02 18:53:49,128 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:49,128 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 40, 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-02 18:53:49,349 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-05-02 18:53:49,350 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:49,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:49,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1263941693, now seen corresponding path program 3 times [2021-05-02 18:53:49,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:49,350 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938695990] [2021-05-02 18:53:49,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:49,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:49,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:49,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:53:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 722 proven. 1238 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2021-05-02 18:53:49,666 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:49,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938695990] [2021-05-02 18:53:49,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938695990] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:49,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742565341] [2021-05-02 18:53:49,666 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 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-02 18:53:49,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 18:53:49,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:49,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-02 18:53:49,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:49,908 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 1351 proven. 20 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2021-05-02 18:53:49,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742565341] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:49,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:49,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 4] total 27 [2021-05-02 18:53:49,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815400779] [2021-05-02 18:53:49,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-02 18:53:49,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-02 18:53:49,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2021-05-02 18:53:49,939 INFO L87 Difference]: Start difference. First operand 1703 states and 1891 transitions. Second operand has 27 states, 27 states have (on average 4.185185185185185) internal successors, (113), 26 states have internal predecessors, (113), 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-02 18:53:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:51,765 INFO L93 Difference]: Finished difference Result 1307 states and 1435 transitions. [2021-05-02 18:53:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-05-02 18:53:51,765 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.185185185185185) internal successors, (113), 26 states have internal predecessors, (113), 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 156 [2021-05-02 18:53:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:51,779 INFO L225 Difference]: With dead ends: 1307 [2021-05-02 18:53:51,779 INFO L226 Difference]: Without dead ends: 1289 [2021-05-02 18:53:51,781 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2579 ImplicationChecksByTransitivity, 1616.2ms TimeCoverageRelationStatistics Valid=3012, Invalid=8760, Unknown=0, NotChecked=0, Total=11772 [2021-05-02 18:53:51,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2021-05-02 18:53:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1196. [2021-05-02 18:53:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1156 states have (on average 1.106401384083045) internal successors, (1279), 1163 states have internal predecessors, (1279), 23 states have call successors, (23), 17 states have call predecessors, (23), 16 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-02 18:53:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1324 transitions. [2021-05-02 18:53:51,796 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1324 transitions. Word has length 156 [2021-05-02 18:53:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:51,796 INFO L480 AbstractCegarLoop]: Abstraction has 1196 states and 1324 transitions. [2021-05-02 18:53:51,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 4.185185185185185) internal successors, (113), 26 states have internal predecessors, (113), 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-02 18:53:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1324 transitions. [2021-05-02 18:53:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-05-02 18:53:51,800 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:51,800 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-02 18:53:52,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-05-02 18:53:52,023 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:52,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:52,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1785002665, now seen corresponding path program 4 times [2021-05-02 18:53:52,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:52,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664233942] [2021-05-02 18:53:52,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:52,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:52,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:52,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:53:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:52,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:53:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:52,713 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-02 18:53:52,713 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:52,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664233942] [2021-05-02 18:53:52,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664233942] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:52,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842479381] [2021-05-02 18:53:52,713 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 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-02 18:53:52,819 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 18:53:52,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:52,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 67 conjunts are in the unsatisfiable core [2021-05-02 18:53:52,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:52,903 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:52,905 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:52,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:52,935 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:52,962 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:52,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,000 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,001 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,038 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,068 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,069 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,103 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,104 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,135 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,167 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,199 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,200 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,232 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,233 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,321 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,370 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,406 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,407 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,443 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,445 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,497 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,498 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,546 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,547 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,598 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,637 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,862 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,864 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,894 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,895 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:53,992 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,025 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,060 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,061 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,097 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,132 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,170 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,171 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,209 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,247 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,248 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,288 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,329 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,423 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,467 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,511 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,512 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,604 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,726 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,728 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,730 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,737 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:54,811 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-02 18:53:54,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842479381] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:54,811 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:54,812 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 52] total 78 [2021-05-02 18:53:54,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016533715] [2021-05-02 18:53:54,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-02 18:53:54,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:54,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-02 18:53:54,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1099, Invalid=4907, Unknown=0, NotChecked=0, Total=6006 [2021-05-02 18:53:54,814 INFO L87 Difference]: Start difference. First operand 1196 states and 1324 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-02 18:53:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:58,166 INFO L93 Difference]: Finished difference Result 1743 states and 1917 transitions. [2021-05-02 18:53:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2021-05-02 18:53:58,167 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-02 18:53:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:58,169 INFO L225 Difference]: With dead ends: 1743 [2021-05-02 18:53:58,169 INFO L226 Difference]: Without dead ends: 777 [2021-05-02 18:53:58,170 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7898 ImplicationChecksByTransitivity, 4082.6ms TimeCoverageRelationStatistics Valid=3580, Invalid=18472, Unknown=0, NotChecked=0, Total=22052 [2021-05-02 18:53:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2021-05-02 18:53:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 570. [2021-05-02 18:53:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 550 states have (on average 1.02) internal successors, (561), 553 states have internal predecessors, (561), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-02 18:53:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 586 transitions. [2021-05-02 18:53:58,175 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 586 transitions. Word has length 224 [2021-05-02 18:53:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:58,175 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 586 transitions. [2021-05-02 18:53:58,175 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-02 18:53:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 586 transitions. [2021-05-02 18:53:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-05-02 18:53:58,177 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:58,177 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-02 18:53:58,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-05-02 18:53:58,378 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:58,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:58,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1121780440, now seen corresponding path program 2 times [2021-05-02 18:53:58,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:58,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548691280] [2021-05-02 18:53:58,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:58,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:58,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:58,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:53:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:58,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:53:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:58,488 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-02 18:53:58,488 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:58,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548691280] [2021-05-02 18:53:58,489 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548691280] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:58,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404078132] [2021-05-02 18:53:58,489 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 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-02 18:53:58,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 18:53:58,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:58,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-02 18:53:58,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:58,709 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:58,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:58,722 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:58,723 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:58,825 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:58,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:58,838 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:58,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:58,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:58,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:58,969 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:58,975 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-02 18:53:58,975 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404078132] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:58,975 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:53:58,975 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-05-02 18:53:58,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768654801] [2021-05-02 18:53:58,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 18:53:58,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:53:58,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 18:53:58,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-05-02 18:53:58,976 INFO L87 Difference]: Start difference. First operand 570 states and 586 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-02 18:53:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:53:59,093 INFO L93 Difference]: Finished difference Result 637 states and 655 transitions. [2021-05-02 18:53:59,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 18:53:59,094 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-02 18:53:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:53:59,095 INFO L225 Difference]: With dead ends: 637 [2021-05-02 18:53:59,095 INFO L226 Difference]: Without dead ends: 637 [2021-05-02 18:53:59,095 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 101.2ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-05-02 18:53:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2021-05-02 18:53:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2021-05-02 18:53:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 616 states have (on average 1.0194805194805194) internal successors, (628), 619 states have internal predecessors, (628), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2021-05-02 18:53:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 655 transitions. [2021-05-02 18:53:59,101 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 655 transitions. Word has length 224 [2021-05-02 18:53:59,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:53:59,101 INFO L480 AbstractCegarLoop]: Abstraction has 637 states and 655 transitions. [2021-05-02 18:53:59,101 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-02 18:53:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 655 transitions. [2021-05-02 18:53:59,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2021-05-02 18:53:59,103 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:53:59,103 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-02 18:53:59,316 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:53:59,317 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:53:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:53:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1926786838, now seen corresponding path program 3 times [2021-05-02 18:53:59,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:53:59,317 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669915714] [2021-05-02 18:53:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:53:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:59,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:53:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:59,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:53:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:59,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:53:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:59,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:53:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:59,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:53:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:53:59,446 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-02 18:53:59,446 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:53:59,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669915714] [2021-05-02 18:53:59,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669915714] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:53:59,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165627173] [2021-05-02 18:53:59,447 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 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-02 18:53:59,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2021-05-02 18:53:59,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:53:59,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-02 18:53:59,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:53:59,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:59,795 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:59,807 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:59,808 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:59,923 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:59,924 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:59,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:53:59,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,050 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,066 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,068 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,193 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,199 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-02 18:54:00,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165627173] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:00,199 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:00,199 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-05-02 18:54:00,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469893334] [2021-05-02 18:54:00,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 18:54:00,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:00,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 18:54:00,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-05-02 18:54:00,200 INFO L87 Difference]: Start difference. First operand 637 states and 655 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-02 18:54:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:00,379 INFO L93 Difference]: Finished difference Result 704 states and 724 transitions. [2021-05-02 18:54:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 18:54:00,380 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-02 18:54:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:00,382 INFO L225 Difference]: With dead ends: 704 [2021-05-02 18:54:00,382 INFO L226 Difference]: Without dead ends: 704 [2021-05-02 18:54:00,382 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 119.9ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-05-02 18:54:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-05-02 18:54:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2021-05-02 18:54:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 682 states have (on average 1.0190615835777126) internal successors, (695), 685 states have internal predecessors, (695), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2021-05-02 18:54:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 724 transitions. [2021-05-02 18:54:00,387 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 724 transitions. Word has length 295 [2021-05-02 18:54:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:00,388 INFO L480 AbstractCegarLoop]: Abstraction has 704 states and 724 transitions. [2021-05-02 18:54:00,388 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-02 18:54:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 724 transitions. [2021-05-02 18:54:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2021-05-02 18:54:00,390 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:00,390 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-02 18:54:00,612 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-05-02 18:54:00,612 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:00,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:00,612 INFO L82 PathProgramCache]: Analyzing trace with hash -857517800, now seen corresponding path program 4 times [2021-05-02 18:54:00,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:00,612 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828395423] [2021-05-02 18:54:00,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:00,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:00,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:00,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:00,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:00,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:00,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:00,788 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-02 18:54:00,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:00,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828395423] [2021-05-02 18:54:00,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828395423] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:00,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930945007] [2021-05-02 18:54:00,789 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 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-02 18:54:00,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 18:54:00,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:00,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 28 conjunts are in the unsatisfiable core [2021-05-02 18:54:00,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:00,952 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,970 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,971 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,988 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:00,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,028 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,029 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,049 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,050 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,091 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,093 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,112 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,155 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,156 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,201 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,202 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,226 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,251 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,278 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,304 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,305 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,332 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,360 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,361 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,388 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,430 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,431 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,452 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,580 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,736 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,758 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,874 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,896 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:01,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:02,016 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:02,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:02,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:02,046 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-02 18:54:02,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930945007] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:02,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:02,047 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 30] total 37 [2021-05-02 18:54:02,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382149938] [2021-05-02 18:54:02,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-02 18:54:02,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:02,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-02 18:54:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=986, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 18:54:02,048 INFO L87 Difference]: Start difference. First operand 704 states and 724 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-02 18:54:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:02,689 INFO L93 Difference]: Finished difference Result 771 states and 793 transitions. [2021-05-02 18:54:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-02 18:54:02,690 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-02 18:54:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:02,692 INFO L225 Difference]: With dead ends: 771 [2021-05-02 18:54:02,692 INFO L226 Difference]: Without dead ends: 771 [2021-05-02 18:54:02,692 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 343 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 915.7ms TimeCoverageRelationStatistics Valid=1070, Invalid=2236, Unknown=0, NotChecked=0, Total=3306 [2021-05-02 18:54:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2021-05-02 18:54:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2021-05-02 18:54:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 748 states have (on average 1.018716577540107) internal successors, (762), 751 states have internal predecessors, (762), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-02 18:54:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 793 transitions. [2021-05-02 18:54:02,699 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 793 transitions. Word has length 366 [2021-05-02 18:54:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:02,700 INFO L480 AbstractCegarLoop]: Abstraction has 771 states and 793 transitions. [2021-05-02 18:54:02,700 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-02 18:54:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 793 transitions. [2021-05-02 18:54:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2021-05-02 18:54:02,703 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:02,703 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-02 18:54:02,924 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-05-02 18:54:02,925 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:02,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:02,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1004247254, now seen corresponding path program 5 times [2021-05-02 18:54:02,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:02,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720100053] [2021-05-02 18:54:02,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:03,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:03,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:03,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:03,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:03,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:03,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:03,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:03,105 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-02 18:54:03,106 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:03,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720100053] [2021-05-02 18:54:03,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720100053] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:03,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107975737] [2021-05-02 18:54:03,106 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 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-02 18:54:03,313 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2021-05-02 18:54:03,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:03,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 29 conjunts are in the unsatisfiable core [2021-05-02 18:54:03,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:03,423 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,456 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,472 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,473 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,489 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,490 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,507 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,524 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,563 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,564 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,584 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,585 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,615 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,616 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,670 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,713 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,714 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,737 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,738 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,764 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,788 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,855 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,883 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,915 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,916 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,942 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,968 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,969 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:03,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,106 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,249 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,274 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,390 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,391 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,414 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,415 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 563 proven. 18758 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2021-05-02 18:54:04,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107975737] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:04,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:04,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 31] total 39 [2021-05-02 18:54:04,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054222279] [2021-05-02 18:54:04,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-02 18:54:04,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:04,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-02 18:54:04,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1123, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 18:54:04,577 INFO L87 Difference]: Start difference. First operand 771 states and 793 transitions. Second operand has 39 states, 39 states have (on average 4.743589743589744) internal successors, (185), 38 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-02 18:54:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:05,570 INFO L93 Difference]: Finished difference Result 838 states and 862 transitions. [2021-05-02 18:54:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-02 18:54:05,571 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.743589743589744) internal successors, (185), 38 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-02 18:54:05,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:05,573 INFO L225 Difference]: With dead ends: 838 [2021-05-02 18:54:05,573 INFO L226 Difference]: Without dead ends: 838 [2021-05-02 18:54:05,574 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 415 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 1202.3ms TimeCoverageRelationStatistics Valid=2053, Invalid=4267, Unknown=0, NotChecked=0, Total=6320 [2021-05-02 18:54:05,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-05-02 18:54:05,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2021-05-02 18:54:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 814 states have (on average 1.0184275184275184) internal successors, (829), 817 states have internal predecessors, (829), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 18:54:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 862 transitions. [2021-05-02 18:54:05,582 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 862 transitions. Word has length 437 [2021-05-02 18:54:05,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:05,583 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 862 transitions. [2021-05-02 18:54:05,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 4.743589743589744) internal successors, (185), 38 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-02 18:54:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 862 transitions. [2021-05-02 18:54:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2021-05-02 18:54:05,586 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:05,586 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-02 18:54:05,800 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-05-02 18:54:05,801 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:05,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1317032104, now seen corresponding path program 6 times [2021-05-02 18:54:05,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:05,801 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807931616] [2021-05-02 18:54:05,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:05,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:05,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:05,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:05,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:05,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:06,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:06,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:06,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:06,007 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-02 18:54:06,007 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:06,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807931616] [2021-05-02 18:54:06,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807931616] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:06,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036877482] [2021-05-02 18:54:06,007 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 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-02 18:54:06,275 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2021-05-02 18:54:06,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:06,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 10 conjunts are in the unsatisfiable core [2021-05-02 18:54:06,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:06,409 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,410 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,422 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,518 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,520 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,532 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,643 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,740 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,757 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,758 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,872 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,898 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:06,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:07,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:07,013 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:07,029 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:07,030 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:07,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:07,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:07,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:07,162 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-02 18:54:07,162 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036877482] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:07,162 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:07,162 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-05-02 18:54:07,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618543368] [2021-05-02 18:54:07,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 18:54:07,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:07,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 18:54:07,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2021-05-02 18:54:07,164 INFO L87 Difference]: Start difference. First operand 838 states and 862 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-02 18:54:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:07,369 INFO L93 Difference]: Finished difference Result 905 states and 931 transitions. [2021-05-02 18:54:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 18:54:07,370 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-02 18:54:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:07,372 INFO L225 Difference]: With dead ends: 905 [2021-05-02 18:54:07,372 INFO L226 Difference]: Without dead ends: 905 [2021-05-02 18:54:07,372 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 193.1ms TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2021-05-02 18:54:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2021-05-02 18:54:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2021-05-02 18:54:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 880 states have (on average 1.018181818181818) internal successors, (896), 883 states have internal predecessors, (896), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2021-05-02 18:54:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 931 transitions. [2021-05-02 18:54:07,380 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 931 transitions. Word has length 508 [2021-05-02 18:54:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:07,381 INFO L480 AbstractCegarLoop]: Abstraction has 905 states and 931 transitions. [2021-05-02 18:54:07,381 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-02 18:54:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 931 transitions. [2021-05-02 18:54:07,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2021-05-02 18:54:07,385 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:07,385 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-02 18:54:07,596 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-05-02 18:54:07,597 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:07,597 INFO L82 PathProgramCache]: Analyzing trace with hash 282505878, now seen corresponding path program 7 times [2021-05-02 18:54:07,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:07,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915215285] [2021-05-02 18:54:07,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:07,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:07,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:07,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:07,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:07,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:07,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:07,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:07,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:07,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 18:54:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:07,810 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-02 18:54:07,810 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:07,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915215285] [2021-05-02 18:54:07,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915215285] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:07,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010958420] [2021-05-02 18:54:07,810 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 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-02 18:54:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:07,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-02 18:54:07,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:08,093 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,094 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,110 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,111 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,240 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,243 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,256 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,353 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,464 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,479 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,479 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,576 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,577 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,591 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,592 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,729 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,730 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,842 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,843 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:08,962 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-02 18:54:08,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010958420] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:08,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:08,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-05-02 18:54:08,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847475351] [2021-05-02 18:54:08,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 18:54:08,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:08,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 18:54:08,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2021-05-02 18:54:08,963 INFO L87 Difference]: Start difference. First operand 905 states and 931 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-02 18:54:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:09,179 INFO L93 Difference]: Finished difference Result 972 states and 1000 transitions. [2021-05-02 18:54:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 18:54:09,179 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-02 18:54:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:09,182 INFO L225 Difference]: With dead ends: 972 [2021-05-02 18:54:09,182 INFO L226 Difference]: Without dead ends: 972 [2021-05-02 18:54:09,182 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 204.8ms TimeCoverageRelationStatistics Valid=180, Invalid=326, Unknown=0, NotChecked=0, Total=506 [2021-05-02 18:54:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2021-05-02 18:54:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2021-05-02 18:54:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 946 states have (on average 1.017970401691332) internal successors, (963), 949 states have internal predecessors, (963), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 18:54:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1000 transitions. [2021-05-02 18:54:09,190 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1000 transitions. Word has length 579 [2021-05-02 18:54:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:09,190 INFO L480 AbstractCegarLoop]: Abstraction has 972 states and 1000 transitions. [2021-05-02 18:54:09,191 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-02 18:54:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1000 transitions. [2021-05-02 18:54:09,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2021-05-02 18:54:09,195 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:09,195 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-02 18:54:09,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-05-02 18:54:09,409 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:09,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1210704488, now seen corresponding path program 8 times [2021-05-02 18:54:09,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:09,409 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421230463] [2021-05-02 18:54:09,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:09,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:09,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:09,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:09,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:09,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:09,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:09,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:09,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:09,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 18:54:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:09,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 18:54:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:09,672 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-02 18:54:09,672 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:09,672 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421230463] [2021-05-02 18:54:09,672 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421230463] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:09,672 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176969403] [2021-05-02 18:54:09,672 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 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-02 18:54:09,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 18:54:09,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:09,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 12 conjunts are in the unsatisfiable core [2021-05-02 18:54:09,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:09,982 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:09,983 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:09,997 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:09,998 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,112 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,226 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,323 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,452 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,467 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,585 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,715 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,738 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,739 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,852 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,853 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,871 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,968 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,969 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,986 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:10,993 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-02 18:54:10,994 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176969403] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:10,994 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:10,994 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-05-02 18:54:10,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854848281] [2021-05-02 18:54:10,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 18:54:10,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:10,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 18:54:10,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2021-05-02 18:54:10,995 INFO L87 Difference]: Start difference. First operand 972 states and 1000 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-02 18:54:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:11,236 INFO L93 Difference]: Finished difference Result 1039 states and 1069 transitions. [2021-05-02 18:54:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 18:54:11,237 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-02 18:54:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:11,239 INFO L225 Difference]: With dead ends: 1039 [2021-05-02 18:54:11,239 INFO L226 Difference]: Without dead ends: 1039 [2021-05-02 18:54:11,240 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 660 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 237.9ms TimeCoverageRelationStatistics Valid=214, Invalid=386, Unknown=0, NotChecked=0, Total=600 [2021-05-02 18:54:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2021-05-02 18:54:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1039. [2021-05-02 18:54:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1012 states have (on average 1.017786561264822) internal successors, (1030), 1015 states have internal predecessors, (1030), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-05-02 18:54:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1069 transitions. [2021-05-02 18:54:11,248 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1069 transitions. Word has length 650 [2021-05-02 18:54:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:11,248 INFO L480 AbstractCegarLoop]: Abstraction has 1039 states and 1069 transitions. [2021-05-02 18:54:11,249 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-02 18:54:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1069 transitions. [2021-05-02 18:54:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2021-05-02 18:54:11,254 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:11,254 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-02 18:54:11,472 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-05-02 18:54:11,473 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:11,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:11,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1171932074, now seen corresponding path program 9 times [2021-05-02 18:54:11,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:11,473 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707969153] [2021-05-02 18:54:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:11,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:11,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:11,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:11,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:11,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:11,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:11,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:11,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:11,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 18:54:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:11,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 18:54:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:11,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 18:54:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:11,774 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-02 18:54:11,774 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:11,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707969153] [2021-05-02 18:54:11,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707969153] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:11,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271599215] [2021-05-02 18:54:11,774 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 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-02 18:54:12,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2021-05-02 18:54:12,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:12,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-02 18:54:12,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:12,189 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,191 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,202 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,314 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,315 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,328 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,439 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,440 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,455 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,456 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,574 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,575 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,686 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,687 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,787 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,788 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,803 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,900 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:12,931 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:13,030 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:13,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:13,047 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:13,048 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:13,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:13,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:13,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:13,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:13,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:13,263 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:13,280 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:13,288 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-02 18:54:13,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271599215] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:13,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:13,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-02 18:54:13,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442246271] [2021-05-02 18:54:13,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 18:54:13,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:13,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 18:54:13,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2021-05-02 18:54:13,290 INFO L87 Difference]: Start difference. First operand 1039 states and 1069 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-02 18:54:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:13,534 INFO L93 Difference]: Finished difference Result 1106 states and 1138 transitions. [2021-05-02 18:54:13,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 18:54:13,535 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-02 18:54:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:13,537 INFO L225 Difference]: With dead ends: 1106 [2021-05-02 18:54:13,537 INFO L226 Difference]: Without dead ends: 1106 [2021-05-02 18:54:13,537 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 297.7ms TimeCoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2021-05-02 18:54:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2021-05-02 18:54:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2021-05-02 18:54:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1078 states have (on average 1.0176252319109462) internal successors, (1097), 1081 states have internal predecessors, (1097), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2021-05-02 18:54:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1138 transitions. [2021-05-02 18:54:13,545 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1138 transitions. Word has length 721 [2021-05-02 18:54:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:13,546 INFO L480 AbstractCegarLoop]: Abstraction has 1106 states and 1138 transitions. [2021-05-02 18:54:13,546 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-02 18:54:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1138 transitions. [2021-05-02 18:54:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2021-05-02 18:54:13,552 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:13,552 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-02 18:54:13,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2021-05-02 18:54:13,775 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:13,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:13,775 INFO L82 PathProgramCache]: Analyzing trace with hash 403348440, now seen corresponding path program 10 times [2021-05-02 18:54:13,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:13,775 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972423742] [2021-05-02 18:54:13,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 18:54:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 18:54:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 18:54:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 18:54:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:14,090 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-02 18:54:14,090 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:14,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972423742] [2021-05-02 18:54:14,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972423742] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:14,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998035332] [2021-05-02 18:54:14,091 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 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-02 18:54:14,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 18:54:14,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:14,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 34 conjunts are in the unsatisfiable core [2021-05-02 18:54:14,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:14,375 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,376 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,399 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,400 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,425 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,448 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,449 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,473 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,501 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,524 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,546 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,547 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,569 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,594 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,618 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,642 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,668 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,670 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,696 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,723 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,754 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,755 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,797 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,801 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,840 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,876 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,878 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,908 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,961 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:14,962 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,110 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,111 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,224 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,254 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,404 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,405 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,520 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,659 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,684 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,801 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,802 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,944 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,945 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,971 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:15,972 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:16,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:16,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:16,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:16,128 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:16,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:16,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:16,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:16,290 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:16,420 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:16,422 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:16,449 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:16,458 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-02 18:54:16,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998035332] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:16,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:16,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 36] total 49 [2021-05-02 18:54:16,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653930764] [2021-05-02 18:54:16,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-02 18:54:16,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:16,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-02 18:54:16,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=1811, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 18:54:16,459 INFO L87 Difference]: Start difference. First operand 1106 states and 1138 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-02 18:54:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:17,132 INFO L93 Difference]: Finished difference Result 1173 states and 1207 transitions. [2021-05-02 18:54:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-02 18:54:17,133 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-02 18:54:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:17,135 INFO L225 Difference]: With dead ends: 1173 [2021-05-02 18:54:17,135 INFO L226 Difference]: Without dead ends: 1173 [2021-05-02 18:54:17,135 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 763 SyntacticMatches, 20 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 1300.5ms TimeCoverageRelationStatistics Valid=1505, Invalid=3325, Unknown=0, NotChecked=0, Total=4830 [2021-05-02 18:54:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2021-05-02 18:54:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2021-05-02 18:54:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1144 states have (on average 1.0174825174825175) internal successors, (1164), 1147 states have internal predecessors, (1164), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2021-05-02 18:54:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1207 transitions. [2021-05-02 18:54:17,142 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1207 transitions. Word has length 792 [2021-05-02 18:54:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:17,143 INFO L480 AbstractCegarLoop]: Abstraction has 1173 states and 1207 transitions. [2021-05-02 18:54:17,143 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-02 18:54:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1207 transitions. [2021-05-02 18:54:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2021-05-02 18:54:17,150 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:17,151 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-02 18:54:17,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:54:17,365 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:17,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:17,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1864676886, now seen corresponding path program 11 times [2021-05-02 18:54:17,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:17,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620217496] [2021-05-02 18:54:17,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 18:54:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 18:54:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 18:54:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 18:54:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 18:54:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:17,725 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-02 18:54:17,726 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:17,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620217496] [2021-05-02 18:54:17,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620217496] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:17,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065261562] [2021-05-02 18:54:17,727 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 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-02 18:54:18,317 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 91 check-sat command(s) [2021-05-02 18:54:18,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:18,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 37 conjunts are in the unsatisfiable core [2021-05-02 18:54:18,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:18,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,467 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,492 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,510 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,511 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,529 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,530 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,549 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,569 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,592 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,614 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,615 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,637 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,661 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,686 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,718 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,743 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,744 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,770 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,798 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,857 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,888 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,890 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,919 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:18,952 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,011 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,057 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,058 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,173 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,174 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,364 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,492 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,522 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,647 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,648 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,673 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,791 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,792 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,937 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:19,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,123 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,124 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,260 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,288 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,410 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,411 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,441 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,442 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,575 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,576 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:20,614 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-02 18:54:20,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065261562] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:20,615 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:20,615 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 38] total 52 [2021-05-02 18:54:20,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780495313] [2021-05-02 18:54:20,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 18:54:20,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 18:54:20,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2044, Unknown=0, NotChecked=0, Total=2652 [2021-05-02 18:54:20,616 INFO L87 Difference]: Start difference. First operand 1173 states and 1207 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-02 18:54:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:21,734 INFO L93 Difference]: Finished difference Result 1240 states and 1276 transitions. [2021-05-02 18:54:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-02 18:54:21,735 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-02 18:54:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:21,736 INFO L225 Difference]: With dead ends: 1240 [2021-05-02 18:54:21,736 INFO L226 Difference]: Without dead ends: 1240 [2021-05-02 18:54:21,737 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 946 GetRequests, 834 SyntacticMatches, 20 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2529 ImplicationChecksByTransitivity, 1709.7ms TimeCoverageRelationStatistics Valid=2893, Invalid=5849, Unknown=0, NotChecked=0, Total=8742 [2021-05-02 18:54:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2021-05-02 18:54:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2021-05-02 18:54:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1210 states have (on average 1.0173553719008264) internal successors, (1231), 1213 states have internal predecessors, (1231), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-02 18:54:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1276 transitions. [2021-05-02 18:54:21,746 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1276 transitions. Word has length 863 [2021-05-02 18:54:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:21,747 INFO L480 AbstractCegarLoop]: Abstraction has 1240 states and 1276 transitions. [2021-05-02 18:54:21,747 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-02 18:54:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1276 transitions. [2021-05-02 18:54:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2021-05-02 18:54:21,755 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:21,755 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-02 18:54:21,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:54:21,969 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:21,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1153357288, now seen corresponding path program 12 times [2021-05-02 18:54:21,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:21,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983001412] [2021-05-02 18:54:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 18:54:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 18:54:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 18:54:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 18:54:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 18:54:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 18:54:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:22,378 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-02 18:54:22,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:22,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983001412] [2021-05-02 18:54:22,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983001412] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:22,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806133184] [2021-05-02 18:54:22,379 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 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-02 18:54:22,813 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2021-05-02 18:54:22,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:22,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 16 conjunts are in the unsatisfiable core [2021-05-02 18:54:22,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:22,947 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:22,948 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:22,960 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:22,961 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,065 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,067 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,079 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,185 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,199 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,200 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,305 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,321 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,427 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,428 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,442 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,443 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,558 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,573 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,573 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,670 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,687 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,688 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,785 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,786 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,803 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,902 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:23,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,038 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,156 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,157 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,254 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,274 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,372 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,373 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,392 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:24,402 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-02 18:54:24,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806133184] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:24,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:24,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-05-02 18:54:24,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259688592] [2021-05-02 18:54:24,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 18:54:24,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:24,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 18:54:24,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=616, Unknown=0, NotChecked=0, Total=992 [2021-05-02 18:54:24,404 INFO L87 Difference]: Start difference. First operand 1240 states and 1276 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-02 18:54:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:24,708 INFO L93 Difference]: Finished difference Result 1307 states and 1345 transitions. [2021-05-02 18:54:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 18:54:24,709 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-02 18:54:24,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:24,711 INFO L225 Difference]: With dead ends: 1307 [2021-05-02 18:54:24,711 INFO L226 Difference]: Without dead ends: 1307 [2021-05-02 18:54:24,711 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 948 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 349.5ms TimeCoverageRelationStatistics Valid=380, Invalid=676, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 18:54:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2021-05-02 18:54:24,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1307. [2021-05-02 18:54:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 1276 states have (on average 1.0172413793103448) internal successors, (1298), 1279 states have internal predecessors, (1298), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 18:54:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1345 transitions. [2021-05-02 18:54:24,721 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1345 transitions. Word has length 934 [2021-05-02 18:54:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:24,721 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1345 transitions. [2021-05-02 18:54:24,721 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-02 18:54:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1345 transitions. [2021-05-02 18:54:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2021-05-02 18:54:24,730 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:24,731 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-02 18:54:24,943 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:54:24,943 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1775263786, now seen corresponding path program 13 times [2021-05-02 18:54:24,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:24,944 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228936083] [2021-05-02 18:54:24,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 18:54:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 18:54:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 18:54:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 18:54:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 18:54:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 18:54:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-02 18:54:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,379 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-02 18:54:25,379 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:25,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228936083] [2021-05-02 18:54:25,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228936083] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:25,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658303599] [2021-05-02 18:54:25,380 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 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-02 18:54:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:25,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 17 conjunts are in the unsatisfiable core [2021-05-02 18:54:25,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:25,763 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:25,764 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:25,777 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:25,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:25,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:25,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:25,893 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:25,894 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:25,991 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:25,993 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,005 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,006 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,103 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,108 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,141 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,251 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,265 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,366 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,383 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,485 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,486 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,503 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,504 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,623 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,721 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,722 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,740 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,740 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,838 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,857 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:26,974 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:27,070 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:27,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:27,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:27,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:27,196 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:27,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:27,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:27,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:27,316 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:27,317 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:27,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:27,348 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-02 18:54:27,348 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658303599] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:27,348 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:27,348 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2021-05-02 18:54:27,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579948096] [2021-05-02 18:54:27,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 18:54:27,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:27,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 18:54:27,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 18:54:27,349 INFO L87 Difference]: Start difference. First operand 1307 states and 1345 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-02 18:54:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:27,700 INFO L93 Difference]: Finished difference Result 1374 states and 1414 transitions. [2021-05-02 18:54:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 18:54:27,700 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-02 18:54:27,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:27,702 INFO L225 Difference]: With dead ends: 1374 [2021-05-02 18:54:27,702 INFO L226 Difference]: Without dead ends: 1374 [2021-05-02 18:54:27,702 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 1020 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 394.8ms TimeCoverageRelationStatistics Valid=429, Invalid=761, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 18:54:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2021-05-02 18:54:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2021-05-02 18:54:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1342 states have (on average 1.0171385991058122) internal successors, (1365), 1345 states have internal predecessors, (1365), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2021-05-02 18:54:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1414 transitions. [2021-05-02 18:54:27,709 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1414 transitions. Word has length 1005 [2021-05-02 18:54:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:27,710 INFO L480 AbstractCegarLoop]: Abstraction has 1374 states and 1414 transitions. [2021-05-02 18:54:27,710 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-02 18:54:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1414 transitions. [2021-05-02 18:54:27,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2021-05-02 18:54:27,719 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:27,720 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-02 18:54:27,942 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-05-02 18:54:27,943 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:27,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2073938008, now seen corresponding path program 14 times [2021-05-02 18:54:27,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:27,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253214416] [2021-05-02 18:54:27,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 18:54:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 18:54:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 18:54:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 18:54:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 18:54:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 18:54:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-02 18:54:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-02 18:54:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:28,404 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-02 18:54:28,405 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:28,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253214416] [2021-05-02 18:54:28,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253214416] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:28,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033820242] [2021-05-02 18:54:28,405 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 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-02 18:54:28,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 18:54:28,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:28,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 1705 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-02 18:54:28,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:28,811 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:28,813 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:28,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:28,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:28,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:28,935 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:28,948 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:28,949 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,054 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,069 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,174 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,175 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,188 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,189 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,287 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,288 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,302 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,303 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,400 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,416 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,514 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,515 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,532 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,631 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,648 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,747 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,748 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,766 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,767 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,864 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,866 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,982 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:29,983 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,115 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,235 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,355 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,477 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,498 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:30,509 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-02 18:54:30,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033820242] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:30,509 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:30,509 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2021-05-02 18:54:30,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887220822] [2021-05-02 18:54:30,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 18:54:30,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:30,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 18:54:30,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=783, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 18:54:30,511 INFO L87 Difference]: Start difference. First operand 1374 states and 1414 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-02 18:54:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:30,817 INFO L93 Difference]: Finished difference Result 1441 states and 1483 transitions. [2021-05-02 18:54:30,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 18:54:30,817 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-02 18:54:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:30,819 INFO L225 Difference]: With dead ends: 1441 [2021-05-02 18:54:30,819 INFO L226 Difference]: Without dead ends: 1441 [2021-05-02 18:54:30,819 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1092 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 421.2ms TimeCoverageRelationStatistics Valid=481, Invalid=851, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 18:54:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2021-05-02 18:54:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1441. [2021-05-02 18:54:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1408 states have (on average 1.0170454545454546) internal successors, (1432), 1411 states have internal predecessors, (1432), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-05-02 18:54:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 1483 transitions. [2021-05-02 18:54:30,827 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 1483 transitions. Word has length 1076 [2021-05-02 18:54:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:30,827 INFO L480 AbstractCegarLoop]: Abstraction has 1441 states and 1483 transitions. [2021-05-02 18:54:30,827 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-02 18:54:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1483 transitions. [2021-05-02 18:54:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2021-05-02 18:54:30,837 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:30,838 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-02 18:54:31,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:54:31,042 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:31,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:31,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2069726826, now seen corresponding path program 15 times [2021-05-02 18:54:31,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:31,042 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027219529] [2021-05-02 18:54:31,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 18:54:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 18:54:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 18:54:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 18:54:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 18:54:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 18:54:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-02 18:54:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-02 18:54:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-02 18:54:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:31,640 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-02 18:54:31,640 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:31,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027219529] [2021-05-02 18:54:31,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027219529] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:31,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636939558] [2021-05-02 18:54:31,640 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 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-02 18:54:32,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 134 check-sat command(s) [2021-05-02 18:54:32,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:32,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 1811 conjuncts, 19 conjunts are in the unsatisfiable core [2021-05-02 18:54:32,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:32,546 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,547 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,560 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,561 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,662 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,664 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,675 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,774 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,775 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,788 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,887 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,888 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,902 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:32,903 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,003 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,004 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,117 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,118 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,232 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,233 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,249 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,348 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,366 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,483 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,484 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,588 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,589 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,608 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,608 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,728 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,729 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,828 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,848 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,849 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,947 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,948 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,968 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:33,969 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:34,067 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:34,068 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:34,090 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:34,091 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:34,189 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:34,190 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:34,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:34,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:34,311 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:34,312 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:34,334 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:34,346 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-02 18:54:34,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636939558] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:34,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:34,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2021-05-02 18:54:34,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576564525] [2021-05-02 18:54:34,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 18:54:34,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:34,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 18:54:34,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=874, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 18:54:34,348 INFO L87 Difference]: Start difference. First operand 1441 states and 1483 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-02 18:54:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:34,732 INFO L93 Difference]: Finished difference Result 1508 states and 1552 transitions. [2021-05-02 18:54:34,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-02 18:54:34,733 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-02 18:54:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:34,735 INFO L225 Difference]: With dead ends: 1508 [2021-05-02 18:54:34,735 INFO L226 Difference]: Without dead ends: 1508 [2021-05-02 18:54:34,735 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1201 GetRequests, 1164 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 513.0ms TimeCoverageRelationStatistics Valid=536, Invalid=946, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 18:54:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2021-05-02 18:54:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1508. [2021-05-02 18:54:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1474 states have (on average 1.0169606512890095) internal successors, (1499), 1477 states have internal predecessors, (1499), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2021-05-02 18:54:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1552 transitions. [2021-05-02 18:54:34,744 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1552 transitions. Word has length 1147 [2021-05-02 18:54:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:34,745 INFO L480 AbstractCegarLoop]: Abstraction has 1508 states and 1552 transitions. [2021-05-02 18:54:34,745 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-02 18:54:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1552 transitions. [2021-05-02 18:54:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1219 [2021-05-02 18:54:34,754 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:34,754 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-02 18:54:34,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 18:54:34,955 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:34,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1682208408, now seen corresponding path program 16 times [2021-05-02 18:54:34,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:34,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517036122] [2021-05-02 18:54:34,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 18:54:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 18:54:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 18:54:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 18:54:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 18:54:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 18:54:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-02 18:54:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-02 18:54:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-02 18:54:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1143 [2021-05-02 18:54:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:35,568 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-02 18:54:35,568 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:35,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517036122] [2021-05-02 18:54:35,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517036122] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:35,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475436318] [2021-05-02 18:54:35,569 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 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-02 18:54:35,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 18:54:35,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:35,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 1880 conjuncts, 40 conjunts are in the unsatisfiable core [2021-05-02 18:54:35,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:35,883 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:35,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:35,910 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:35,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:35,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:35,935 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:35,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:35,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:35,979 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:35,980 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,002 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,003 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,050 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,076 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,103 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,176 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,256 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,296 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,425 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,470 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,511 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,563 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,565 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,683 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,704 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,705 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,846 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,847 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,872 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,988 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:36,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,013 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,129 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,155 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,273 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,298 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,416 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,442 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,443 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,562 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,563 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,589 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,590 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,737 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,738 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,860 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,861 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,896 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:37,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,020 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,048 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,049 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,171 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,172 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,201 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,202 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,326 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,494 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,527 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,654 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,686 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,687 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,815 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,849 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,849 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,977 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:38,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:39,010 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:39,023 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-02 18:54:39,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475436318] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:39,023 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:39,024 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 42] total 61 [2021-05-02 18:54:39,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848267446] [2021-05-02 18:54:39,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-02 18:54:39,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:39,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-02 18:54:39,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=844, Invalid=2816, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 18:54:39,025 INFO L87 Difference]: Start difference. First operand 1508 states and 1552 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-02 18:54:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:40,022 INFO L93 Difference]: Finished difference Result 1575 states and 1621 transitions. [2021-05-02 18:54:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 18:54:40,023 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-02 18:54:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:40,025 INFO L225 Difference]: With dead ends: 1575 [2021-05-02 18:54:40,025 INFO L226 Difference]: Without dead ends: 1575 [2021-05-02 18:54:40,026 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1295 GetRequests, 1183 SyntacticMatches, 32 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2629 ImplicationChecksByTransitivity, 1853.4ms TimeCoverageRelationStatistics Valid=2048, Invalid=4594, Unknown=0, NotChecked=0, Total=6642 [2021-05-02 18:54:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2021-05-02 18:54:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2021-05-02 18:54:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1540 states have (on average 1.016883116883117) internal successors, (1566), 1543 states have internal predecessors, (1566), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2021-05-02 18:54:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1621 transitions. [2021-05-02 18:54:40,038 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1621 transitions. Word has length 1218 [2021-05-02 18:54:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:40,039 INFO L480 AbstractCegarLoop]: Abstraction has 1575 states and 1621 transitions. [2021-05-02 18:54:40,040 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-02 18:54:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1621 transitions. [2021-05-02 18:54:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1290 [2021-05-02 18:54:40,053 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:40,054 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-02 18:54:40,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-05-02 18:54:40,269 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:40,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1054425942, now seen corresponding path program 17 times [2021-05-02 18:54:40,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:40,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034563522] [2021-05-02 18:54:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 18:54:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 18:54:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 18:54:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 18:54:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 18:54:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 18:54:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-02 18:54:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-02 18:54:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-02 18:54:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1143 [2021-05-02 18:54:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1214 [2021-05-02 18:54:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:40,839 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-02 18:54:40,839 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:40,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034563522] [2021-05-02 18:54:40,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034563522] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:40,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583055780] [2021-05-02 18:54:40,839 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 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-02 18:54:41,710 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 156 check-sat command(s) [2021-05-02 18:54:41,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:41,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 43 conjunts are in the unsatisfiable core [2021-05-02 18:54:41,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:41,857 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:41,858 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:41,876 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:41,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:41,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:41,966 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:41,982 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:41,983 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,010 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,030 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,052 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,054 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,109 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,132 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,157 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,158 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,238 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,268 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,296 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,326 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,327 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,389 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,390 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,438 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,470 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,504 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,540 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,541 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,768 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,769 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,793 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,793 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,912 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,936 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:42,937 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,056 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,057 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,082 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,083 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,204 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,229 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,230 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,351 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,352 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,379 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,499 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,527 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,650 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,679 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,680 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,803 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,832 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,833 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:43,999 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,000 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,124 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,155 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,156 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,283 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,284 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,316 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,317 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,479 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,610 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,775 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,776 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,809 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,810 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:44,987 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-02 18:54:44,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583055780] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:44,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:44,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 44] total 64 [2021-05-02 18:54:44,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774778194] [2021-05-02 18:54:44,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-02 18:54:44,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:44,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-02 18:54:44,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=893, Invalid=3139, Unknown=0, NotChecked=0, Total=4032 [2021-05-02 18:54:44,989 INFO L87 Difference]: Start difference. First operand 1575 states and 1621 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-02 18:54:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:46,790 INFO L93 Difference]: Finished difference Result 1642 states and 1690 transitions. [2021-05-02 18:54:46,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-05-02 18:54:46,791 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-02 18:54:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:46,793 INFO L225 Difference]: With dead ends: 1642 [2021-05-02 18:54:46,793 INFO L226 Difference]: Without dead ends: 1642 [2021-05-02 18:54:46,795 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1411 GetRequests, 1256 SyntacticMatches, 30 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5143 ImplicationChecksByTransitivity, 2572.2ms TimeCoverageRelationStatistics Valid=5372, Invalid=10630, Unknown=0, NotChecked=0, Total=16002 [2021-05-02 18:54:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2021-05-02 18:54:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2021-05-02 18:54:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1606 states have (on average 1.0168119551681196) internal successors, (1633), 1609 states have internal predecessors, (1633), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2021-05-02 18:54:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 1690 transitions. [2021-05-02 18:54:46,807 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 1690 transitions. Word has length 1289 [2021-05-02 18:54:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:46,807 INFO L480 AbstractCegarLoop]: Abstraction has 1642 states and 1690 transitions. [2021-05-02 18:54:46,808 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-02 18:54:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 1690 transitions. [2021-05-02 18:54:46,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1361 [2021-05-02 18:54:46,822 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:46,822 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-02 18:54:47,036 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-05-02 18:54:47,037 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:47,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:47,037 INFO L82 PathProgramCache]: Analyzing trace with hash -245812008, now seen corresponding path program 18 times [2021-05-02 18:54:47,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:47,037 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283753488] [2021-05-02 18:54:47,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:54:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 18:54:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 18:54:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 18:54:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 18:54:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 18:54:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 18:54:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 18:54:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 18:54:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 18:54:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 18:54:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 18:54:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 18:54:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 18:54:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-02 18:54:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-02 18:54:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-02 18:54:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1143 [2021-05-02 18:54:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1214 [2021-05-02 18:54:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1285 [2021-05-02 18:54:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:54:47,622 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-02 18:54:47,622 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:54:47,622 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283753488] [2021-05-02 18:54:47,622 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283753488] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:47,622 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042429850] [2021-05-02 18:54:47,622 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 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-02 18:54:48,246 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 145 check-sat command(s) [2021-05-02 18:54:48,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 18:54:48,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 22 conjunts are in the unsatisfiable core [2021-05-02 18:54:48,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 18:54:48,375 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,377 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,390 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,391 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,492 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,504 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,604 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,720 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,734 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,835 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,836 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,850 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,851 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,955 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,956 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,971 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:48,972 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,088 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,089 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,189 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,190 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,207 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,329 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,348 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,449 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,590 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,591 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,690 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,712 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,811 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,812 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,833 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,834 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,935 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,956 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:49,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,057 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,058 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,081 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,082 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,181 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,205 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,206 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,332 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,431 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,432 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,458 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,560 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,561 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 18:54:50,602 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-02 18:54:50,602 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042429850] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 18:54:50,602 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 18:54:50,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2021-05-02 18:54:50,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282004342] [2021-05-02 18:54:50,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 18:54:50,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:54:50,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 18:54:50,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=1177, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 18:54:50,604 INFO L87 Difference]: Start difference. First operand 1642 states and 1690 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-02 18:54:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:54:51,048 INFO L93 Difference]: Finished difference Result 1709 states and 1759 transitions. [2021-05-02 18:54:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 18:54:51,048 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-02 18:54:51,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:54:51,050 INFO L225 Difference]: With dead ends: 1709 [2021-05-02 18:54:51,050 INFO L226 Difference]: Without dead ends: 1709 [2021-05-02 18:54:51,050 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1423 GetRequests, 1380 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 581.6ms TimeCoverageRelationStatistics Valid=719, Invalid=1261, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 18:54:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2021-05-02 18:54:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1709. [2021-05-02 18:54:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1672 states have (on average 1.0167464114832536) internal successors, (1700), 1675 states have internal predecessors, (1700), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2021-05-02 18:54:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 1759 transitions. [2021-05-02 18:54:51,059 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 1759 transitions. Word has length 1360 [2021-05-02 18:54:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:54:51,059 INFO L480 AbstractCegarLoop]: Abstraction has 1709 states and 1759 transitions. [2021-05-02 18:54:51,059 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-02 18:54:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 1759 transitions. [2021-05-02 18:54:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1432 [2021-05-02 18:54:51,073 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:54:51,074 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-02 18:54:51,274 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2021-05-02 18:54:51,274 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:54:51,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:54:51,275 INFO L82 PathProgramCache]: Analyzing trace with hash 942669078, now seen corresponding path program 19 times [2021-05-02 18:54:51,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:54:51,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874167951] [2021-05-02 18:54:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:54:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 18:54:51,454 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 18:54:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 18:54:51,654 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 18:54:51,968 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-02 18:54:51,968 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-02 18:54:51,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-02 18:54:52,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 06:54:52 BasicIcfg [2021-05-02 18:54:52,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 18:54:52,219 INFO L168 Benchmark]: Toolchain (without parser) took 107732.13 ms. Allocated memory was 200.3 MB in the beginning and 743.4 MB in the end (delta: 543.2 MB). Free memory was 166.5 MB in the beginning and 575.1 MB in the end (delta: -408.5 MB). Peak memory consumption was 479.1 MB. Max. memory is 8.0 GB. [2021-05-02 18:54:52,219 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 200.3 MB. Free memory is still 182.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 18:54:52,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.62 ms. Allocated memory is still 200.3 MB. Free memory was 166.3 MB in the beginning and 156.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-02 18:54:52,219 INFO L168 Benchmark]: Boogie Preprocessor took 24.09 ms. Allocated memory is still 200.3 MB. Free memory was 156.6 MB in the beginning and 155.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-02 18:54:52,219 INFO L168 Benchmark]: RCFGBuilder took 420.20 ms. Allocated memory is still 200.3 MB. Free memory was 155.1 MB in the beginning and 169.6 MB in the end (delta: -14.6 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-05-02 18:54:52,219 INFO L168 Benchmark]: IcfgTransformer took 15.66 ms. Allocated memory is still 200.3 MB. Free memory was 169.6 MB in the beginning and 168.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-02 18:54:52,220 INFO L168 Benchmark]: TraceAbstraction took 107096.03 ms. Allocated memory was 200.3 MB in the beginning and 743.4 MB in the end (delta: 543.2 MB). Free memory was 167.6 MB in the beginning and 575.1 MB in the end (delta: -407.5 MB). Peak memory consumption was 479.8 MB. Max. memory is 8.0 GB. [2021-05-02 18:54:52,220 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.13 ms. Allocated memory is still 200.3 MB. Free memory is still 182.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 167.62 ms. Allocated memory is still 200.3 MB. Free memory was 166.3 MB in the beginning and 156.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 24.09 ms. Allocated memory is still 200.3 MB. Free memory was 156.6 MB in the beginning and 155.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 420.20 ms. Allocated memory is still 200.3 MB. Free memory was 155.1 MB in the beginning and 169.6 MB in the end (delta: -14.6 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * IcfgTransformer took 15.66 ms. Allocated memory is still 200.3 MB. Free memory was 169.6 MB in the beginning and 168.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 107096.03 ms. Allocated memory was 200.3 MB in the beginning and 743.4 MB in the end (delta: 543.2 MB). Free memory was 167.6 MB in the beginning and 575.1 MB in the end (delta: -407.5 MB). Peak memory consumption was 479.8 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 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 106806.1ms, OverallIterations: 53, TraceHistogramMax: 400, EmptinessCheckTime: 175.1ms, AutomataDifference: 36003.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1151 SDtfs, 10797 SDslu, 3255 SDs, 0 SdLazy, 28813 SolverSat, 2462 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12458.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18362 GetRequests, 15937 SyntacticMatches, 121 SemanticMatches, 2304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57560 ImplicationChecksByTransitivity, 38676.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1709occurred in iteration=52, InterpolantAutomatonStates: 1579, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 595.6ms AutomataMinimizationTime, 52 MinimizatonAttempts, 3808 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1232.7ms SsaConstructionTime, 6592.9ms SatisfiabilityAnalysisTime, 50298.6ms InterpolantComputationTime, 33717 NumberOfCodeBlocks, 32464 NumberOfCodeBlocksAsserted, 1007 NumberOfCheckSat, 32188 ConstructedInterpolants, 0 QuantifiedInterpolants, 180197 SizeOfPredicates, 111 NumberOfNonLiveVariables, 26819 ConjunctsInSsa, 844 ConjunctsInUnsatCore, 98 InterpolantComputations, 10 PerfectInterpolantSequences, 259851/3127656 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...