/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/invert_string-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 17:37:12,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 17:37:12,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 17:37:12,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 17:37:12,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 17:37:12,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 17:37:12,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 17:37:12,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 17:37:12,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 17:37:12,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 17:37:12,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 17:37:12,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 17:37:12,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 17:37:12,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 17:37:12,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 17:37:12,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 17:37:12,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 17:37:12,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 17:37:12,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 17:37:12,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 17:37:12,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 17:37:12,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 17:37:12,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 17:37:12,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 17:37:12,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 17:37:12,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 17:37:12,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 17:37:12,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 17:37:12,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 17:37:12,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 17:37:12,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 17:37:12,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 17:37:12,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 17:37:12,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 17:37:12,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 17:37:12,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 17:37:12,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 17:37:12,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 17:37:12,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 17:37:12,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 17:37:12,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 17:37:12,317 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2021-05-02 17:37:12,353 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 17:37:12,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 17:37:12,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 17:37:12,356 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 17:37:12,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 17:37:12,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 17:37:12,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 17:37:12,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 17:37:12,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 17:37:12,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 17:37:12,357 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 17:37:12,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 17:37:12,357 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 17:37:12,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 17:37:12,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 17:37:12,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 17:37:12,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 17:37:12,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 17:37:12,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 17:37:12,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 17:37:12,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 17:37:12,360 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-05-02 17:37:12,360 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 17:37:12,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 17:37:12,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 17:37:12,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 17:37:12,633 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 17:37:12,634 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 17:37:12,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-1.c [2021-05-02 17:37:12,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca24790d9/962278fca6114842a76003792b37af2f/FLAG6617032fe [2021-05-02 17:37:13,279 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 17:37:13,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-1.c [2021-05-02 17:37:13,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca24790d9/962278fca6114842a76003792b37af2f/FLAG6617032fe [2021-05-02 17:37:13,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca24790d9/962278fca6114842a76003792b37af2f [2021-05-02 17:37:13,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 17:37:13,295 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-02 17:37:13,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 17:37:13,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 17:37:13,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 17:37:13,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 05:37:13" (1/1) ... [2021-05-02 17:37:13,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1308c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:37:13, skipping insertion in model container [2021-05-02 17:37:13,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 05:37:13" (1/1) ... [2021-05-02 17:37:13,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 17:37:13,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 17:37:13,393 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/invert_string-1.c[352,365] [2021-05-02 17:37:13,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 17:37:13,408 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 17:37:13,415 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/invert_string-1.c[352,365] [2021-05-02 17:37:13,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 17:37:13,439 INFO L208 MainTranslator]: Completed translation [2021-05-02 17:37:13,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:37:13 WrapperNode [2021-05-02 17:37:13,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 17:37:13,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 17:37:13,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 17:37:13,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 17:37:13,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:37:13" (1/1) ... [2021-05-02 17:37:13,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:37:13" (1/1) ... [2021-05-02 17:37:13,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:37:13" (1/1) ... [2021-05-02 17:37:13,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:37:13" (1/1) ... [2021-05-02 17:37:13,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:37:13" (1/1) ... [2021-05-02 17:37:13,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:37:13" (1/1) ... [2021-05-02 17:37:13,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:37:13" (1/1) ... [2021-05-02 17:37:13,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 17:37:13,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 17:37:13,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 17:37:13,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 17:37:13,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:37:13" (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 17:37:13,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 17:37:13,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 17:37:13,542 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 17:37:13,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 17:37:13,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 17:37:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 17:37:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 17:37:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 17:37:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 17:37:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 17:37:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-05-02 17:37:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-05-02 17:37:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 17:37:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 17:37:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 17:37:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 17:37:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 17:37:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 17:37:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 17:37:13,796 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 17:37:13,796 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-05-02 17:37:13,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 05:37:13 BoogieIcfgContainer [2021-05-02 17:37:13,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 17:37:13,798 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2021-05-02 17:37:13,798 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2021-05-02 17:37:13,798 INFO L275 PluginConnector]: IcfgTransformer initialized [2021-05-02 17:37:13,800 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 05:37:13" (1/1) ... [2021-05-02 17:37:13,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 02.05 05:37:13 BasicIcfg [2021-05-02 17:37:13,828 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2021-05-02 17:37:13,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 17:37:13,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 17:37:13,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 17:37:13,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 05:37:13" (1/4) ... [2021-05-02 17:37:13,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70badb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 05:37:13, skipping insertion in model container [2021-05-02 17:37:13,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:37:13" (2/4) ... [2021-05-02 17:37:13,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70badb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 05:37:13, skipping insertion in model container [2021-05-02 17:37:13,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 05:37:13" (3/4) ... [2021-05-02 17:37:13,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70badb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 05:37:13, skipping insertion in model container [2021-05-02 17:37:13,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 02.05 05:37:13" (4/4) ... [2021-05-02 17:37:13,841 INFO L111 eAbstractionObserver]: Analyzing ICFG invert_string-1.cJordan [2021-05-02 17:37:13,845 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2021-05-02 17:37:13,848 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 17:37:13,859 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 17:37:13,872 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 17:37:13,872 INFO L377 AbstractCegarLoop]: Hoare is false [2021-05-02 17:37:13,872 INFO L378 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2021-05-02 17:37:13,872 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 17:37:13,872 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 17:37:13,872 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 17:37:13,872 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 17:37:13,872 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 17:37:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 17:37:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 17:37:13,887 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:37:13,887 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:37:13,888 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:37:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:37:13,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1459888189, now seen corresponding path program 1 times [2021-05-02 17:37:13,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:37:13,897 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581485202] [2021-05-02 17:37:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:37:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:14,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:37:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:14,079 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 17:37:14,079 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:37:14,079 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581485202] [2021-05-02 17:37:14,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581485202] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:37:14,080 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:37:14,080 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 17:37:14,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633916370] [2021-05-02 17:37:14,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 17:37:14,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:37:14,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 17:37:14,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 17:37:14,097 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:37:14,135 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2021-05-02 17:37:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 17:37:14,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 17:37:14,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:37:14,141 INFO L225 Difference]: With dead ends: 29 [2021-05-02 17:37:14,141 INFO L226 Difference]: Without dead ends: 24 [2021-05-02 17:37:14,142 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 17:37:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-05-02 17:37:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-05-02 17:37:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:37:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2021-05-02 17:37:14,161 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2021-05-02 17:37:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:37:14,161 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-05-02 17:37:14,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2021-05-02 17:37:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 17:37:14,162 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:37:14,162 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:37:14,162 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 17:37:14,162 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:37:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:37:14,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1257013952, now seen corresponding path program 1 times [2021-05-02 17:37:14,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:37:14,163 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110576329] [2021-05-02 17:37:14,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:37:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:14,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:37:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:14,253 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 17:37:14,253 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:37:14,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110576329] [2021-05-02 17:37:14,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110576329] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:37:14,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:37:14,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:37:14,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063009180] [2021-05-02 17:37:14,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:37:14,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:37:14,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:37:14,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:37:14,259 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:37:14,342 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2021-05-02 17:37:14,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 17:37:14,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 17:37:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:37:14,345 INFO L225 Difference]: With dead ends: 30 [2021-05-02 17:37:14,345 INFO L226 Difference]: Without dead ends: 30 [2021-05-02 17:37:14,346 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 51.4ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:37:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-05-02 17:37:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-05-02 17:37:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:37:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-05-02 17:37:14,354 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2021-05-02 17:37:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:37:14,354 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-05-02 17:37:14,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-05-02 17:37:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 17:37:14,356 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:37:14,356 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:37:14,356 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 17:37:14,356 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:37:14,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:37:14,357 INFO L82 PathProgramCache]: Analyzing trace with hash 313528638, now seen corresponding path program 1 times [2021-05-02 17:37:14,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:37:14,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229591734] [2021-05-02 17:37:14,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:37:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:14,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:37:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:14,469 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 17:37:14,470 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:37:14,470 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229591734] [2021-05-02 17:37:14,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229591734] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:37:14,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:37:14,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:37:14,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688736757] [2021-05-02 17:37:14,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:37:14,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:37:14,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:37:14,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:37:14,471 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:37:14,548 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2021-05-02 17:37:14,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 17:37:14,549 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-02 17:37:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:37:14,550 INFO L225 Difference]: With dead ends: 26 [2021-05-02 17:37:14,550 INFO L226 Difference]: Without dead ends: 26 [2021-05-02 17:37:14,551 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 57.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 17:37:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-05-02 17:37:14,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-05-02 17:37:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:37:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-05-02 17:37:14,556 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2021-05-02 17:37:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:37:14,557 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-05-02 17:37:14,557 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2021-05-02 17:37:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 17:37:14,558 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:37:14,558 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 17:37:14,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 17:37:14,558 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:37:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:37:14,559 INFO L82 PathProgramCache]: Analyzing trace with hash -617930468, now seen corresponding path program 1 times [2021-05-02 17:37:14,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:37:14,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334144367] [2021-05-02 17:37:14,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:37:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:14,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:37:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:37:14,825 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:37:14,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334144367] [2021-05-02 17:37:14,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334144367] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:37:14,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285651554] [2021-05-02 17:37:14,827 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 17:37:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:14,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 28 conjunts are in the unsatisfiable core [2021-05-02 17:37:14,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:37:15,033 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,041 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-05-02 17:37:15,061 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 17:37:15,068 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 17:37:15,070 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-05-02 17:37:15,071 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2021-05-02 17:37:15,093 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-05-02 17:37:15,118 INFO L354 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2021-05-02 17:37:15,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 21 [2021-05-02 17:37:15,121 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 17:37:15,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 17:37:15,129 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-05-02 17:37:15,130 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2021-05-02 17:37:15,201 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,206 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,207 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,214 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,215 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,220 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:15,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-05-02 17:37:15,233 INFO L354 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2021-05-02 17:37:15,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 16 [2021-05-02 17:37:15,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 17:37:15,240 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 17:37:15,242 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-05-02 17:37:15,243 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2021-05-02 17:37:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:37:15,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285651554] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:37:15,282 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:37:15,282 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-05-02 17:37:15,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165575277] [2021-05-02 17:37:15,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 17:37:15,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:37:15,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 17:37:15,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-05-02 17:37:15,284 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 22 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:15,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:37:15,807 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2021-05-02 17:37:15,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-02 17:37:15,807 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-02 17:37:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:37:15,808 INFO L225 Difference]: With dead ends: 44 [2021-05-02 17:37:15,808 INFO L226 Difference]: Without dead ends: 29 [2021-05-02 17:37:15,808 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 617.0ms TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 17:37:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-02 17:37:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-05-02 17:37:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:37:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2021-05-02 17:37:15,810 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2021-05-02 17:37:15,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:37:15,811 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2021-05-02 17:37:15,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:15,811 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2021-05-02 17:37:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 17:37:15,821 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:37:15,821 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:37:16,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:37:16,036 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:37:16,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:37:16,036 INFO L82 PathProgramCache]: Analyzing trace with hash 809600538, now seen corresponding path program 2 times [2021-05-02 17:37:16,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:37:16,037 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904532879] [2021-05-02 17:37:16,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:37:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:16,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:37:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:16,091 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 17:37:16,091 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:37:16,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904532879] [2021-05-02 17:37:16,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904532879] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:37:16,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298047185] [2021-05-02 17:37:16,091 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 17:37:16,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 17:37:16,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 17:37:16,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-02 17:37:16,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:37:16,190 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:16,192 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:16,195 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:16,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:16,207 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:16,209 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:37:16,216 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298047185] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:37:16,216 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:37:16,216 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2021-05-02 17:37:16,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889114390] [2021-05-02 17:37:16,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 17:37:16,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:37:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 17:37:16,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 17:37:16,217 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:37:16,327 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-05-02 17:37:16,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 17:37:16,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 17:37:16,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:37:16,328 INFO L225 Difference]: With dead ends: 34 [2021-05-02 17:37:16,328 INFO L226 Difference]: Without dead ends: 34 [2021-05-02 17:37:16,329 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.6ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-05-02 17:37:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-05-02 17:37:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2021-05-02 17:37:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:37:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-05-02 17:37:16,331 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2021-05-02 17:37:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:37:16,331 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-05-02 17:37:16,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-05-02 17:37:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-02 17:37:16,332 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:37:16,332 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:37:16,544 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:37:16,545 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:37:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:37:16,545 INFO L82 PathProgramCache]: Analyzing trace with hash -634204424, now seen corresponding path program 3 times [2021-05-02 17:37:16,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:37:16,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560572018] [2021-05-02 17:37:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:37:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:16,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:37:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:37:16,841 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:37:16,841 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560572018] [2021-05-02 17:37:16,841 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560572018] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:37:16,842 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047472487] [2021-05-02 17:37:16,844 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 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 17:37:16,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 17:37:16,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 17:37:16,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 29 conjunts are in the unsatisfiable core [2021-05-02 17:37:16,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:37:16,908 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:16,909 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:16,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:16,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-05-02 17:37:16,918 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 17:37:16,922 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 17:37:16,922 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-05-02 17:37:16,923 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2021-05-02 17:37:16,996 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,096 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,098 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-05-02 17:37:17,108 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 17:37:17,115 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 17:37:17,116 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-05-02 17:37:17,116 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2021-05-02 17:37:17,174 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,180 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,181 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,185 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,188 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:17,195 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-05-02 17:37:17,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2021-05-02 17:37:17,196 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 17:37:17,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 17:37:17,202 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-05-02 17:37:17,203 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2021-05-02 17:37:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:37:17,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047472487] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:37:17,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:37:17,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-02 17:37:17,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207828029] [2021-05-02 17:37:17,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 17:37:17,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:37:17,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 17:37:17,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2021-05-02 17:37:17,236 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:17,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:37:17,923 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2021-05-02 17:37:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-02 17:37:17,924 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-05-02 17:37:17,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:37:17,924 INFO L225 Difference]: With dead ends: 57 [2021-05-02 17:37:17,924 INFO L226 Difference]: Without dead ends: 57 [2021-05-02 17:37:17,925 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 795.2ms TimeCoverageRelationStatistics Valid=276, Invalid=1446, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 17:37:17,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-02 17:37:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2021-05-02 17:37:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 17:37:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-05-02 17:37:17,928 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2021-05-02 17:37:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:37:17,928 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-05-02 17:37:17,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2021-05-02 17:37:17,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 17:37:17,929 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:37:17,929 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:37:18,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:37:18,144 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:37:18,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:37:18,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1131578614, now seen corresponding path program 4 times [2021-05-02 17:37:18,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:37:18,145 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858690052] [2021-05-02 17:37:18,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:37:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:18,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:37:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:37:18,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:37:18,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858690052] [2021-05-02 17:37:18,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858690052] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:37:18,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082093392] [2021-05-02 17:37:18,196 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 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 17:37:18,228 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 17:37:18,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 17:37:18,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjunts are in the unsatisfiable core [2021-05-02 17:37:18,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:37:18,240 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,241 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,242 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-05-02 17:37:18,260 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 17:37:18,266 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 17:37:18,266 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-05-02 17:37:18,267 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2021-05-02 17:37:18,341 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,343 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,347 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-05-02 17:37:18,353 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 17:37:18,359 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 17:37:18,360 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-05-02 17:37:18,360 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2021-05-02 17:37:18,404 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,460 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,470 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,472 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,473 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,478 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:18,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-05-02 17:37:18,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-05-02 17:37:18,485 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 17:37:18,489 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 17:37:18,491 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-05-02 17:37:18,491 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:3 [2021-05-02 17:37:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-05-02 17:37:18,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082093392] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:37:18,525 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:37:18,525 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2021-05-02 17:37:18,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880231467] [2021-05-02 17:37:18,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 17:37:18,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:37:18,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 17:37:18,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-05-02 17:37:18,526 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:37:19,403 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2021-05-02 17:37:19,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-02 17:37:19,404 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-05-02 17:37:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:37:19,404 INFO L225 Difference]: With dead ends: 80 [2021-05-02 17:37:19,404 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 17:37:19,405 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 671.8ms TimeCoverageRelationStatistics Valid=286, Invalid=1520, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 17:37:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 17:37:19,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2021-05-02 17:37:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 17:37:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2021-05-02 17:37:19,410 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 27 [2021-05-02 17:37:19,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:37:19,410 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2021-05-02 17:37:19,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2021-05-02 17:37:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 17:37:19,411 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:37:19,411 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:37:19,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:37:19,617 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:37:19,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:37:19,617 INFO L82 PathProgramCache]: Analyzing trace with hash -450918700, now seen corresponding path program 5 times [2021-05-02 17:37:19,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:37:19,617 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002086011] [2021-05-02 17:37:19,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:37:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:19,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:37:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:37:19,898 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:37:19,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002086011] [2021-05-02 17:37:19,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002086011] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:37:19,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594089106] [2021-05-02 17:37:19,899 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 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 17:37:19,950 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-05-02 17:37:19,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 17:37:19,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2021-05-02 17:37:19,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:37:19,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:19,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:19,966 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:19,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-05-02 17:37:19,970 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 17:37:19,973 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 17:37:19,973 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-05-02 17:37:19,973 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2021-05-02 17:37:20,052 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,167 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,169 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-05-02 17:37:20,181 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 17:37:20,187 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 17:37:20,188 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-05-02 17:37:20,188 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2021-05-02 17:37:20,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,260 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,260 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,264 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,264 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,265 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,268 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,268 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,269 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:20,277 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-05-02 17:37:20,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2021-05-02 17:37:20,278 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 17:37:20,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 17:37:20,288 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-05-02 17:37:20,288 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2021-05-02 17:37:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:37:20,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594089106] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:37:20,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:37:20,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2021-05-02 17:37:20,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152820183] [2021-05-02 17:37:20,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 17:37:20,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:37:20,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 17:37:20,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2021-05-02 17:37:20,321 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 27 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:37:21,222 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2021-05-02 17:37:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-02 17:37:21,222 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 27 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-05-02 17:37:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:37:21,224 INFO L225 Difference]: With dead ends: 93 [2021-05-02 17:37:21,224 INFO L226 Difference]: Without dead ends: 93 [2021-05-02 17:37:21,225 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 949.9ms TimeCoverageRelationStatistics Valid=346, Invalid=2104, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 17:37:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-02 17:37:21,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2021-05-02 17:37:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 59 states have internal predecessors, (64), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 17:37:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2021-05-02 17:37:21,229 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 29 [2021-05-02 17:37:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:37:21,229 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2021-05-02 17:37:21,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 27 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2021-05-02 17:37:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 17:37:21,230 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:37:21,230 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:37:21,448 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:37:21,449 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:37:21,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:37:21,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1686630958, now seen corresponding path program 6 times [2021-05-02 17:37:21,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:37:21,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207955413] [2021-05-02 17:37:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:37:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:21,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:37:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:37:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:37:21,512 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:37:21,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207955413] [2021-05-02 17:37:21,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207955413] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:37:21,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630418676] [2021-05-02 17:37:21,513 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 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 17:37:21,571 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-05-02 17:37:21,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 17:37:21,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2021-05-02 17:37:21,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:37:21,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,588 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,592 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,614 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,618 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,622 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,623 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:37:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:37:21,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630418676] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:37:21,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:37:21,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2021-05-02 17:37:21,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725641781] [2021-05-02 17:37:21,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 17:37:21,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:37:21,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 17:37:21,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-05-02 17:37:21,642 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:37:21,835 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2021-05-02 17:37:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 17:37:21,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-05-02 17:37:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:37:21,836 INFO L225 Difference]: With dead ends: 93 [2021-05-02 17:37:21,836 INFO L226 Difference]: Without dead ends: 93 [2021-05-02 17:37:21,836 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 61.2ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-05-02 17:37:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-02 17:37:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2021-05-02 17:37:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 59 states have (on average 1.11864406779661) internal successors, (66), 61 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 17:37:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2021-05-02 17:37:21,853 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 31 [2021-05-02 17:37:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:37:21,854 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2021-05-02 17:37:21,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:37:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2021-05-02 17:37:21,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 17:37:21,857 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:37:21,857 INFO L523 BasicCegarLoop]: trace histogram [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 17:37:22,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:37:22,077 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:37:22,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:37:22,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1779570578, now seen corresponding path program 1 times [2021-05-02 17:37:22,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:37:22,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230394120] [2021-05-02 17:37:22,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:37:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 17:37:22,097 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 17:37:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 17:37:22,129 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 17:37:22,152 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-02 17:37:22,153 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-02 17:37:22,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 17:37:22,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 05:37:22 BasicIcfg [2021-05-02 17:37:22,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 17:37:22,199 INFO L168 Benchmark]: Toolchain (without parser) took 8903.81 ms. Allocated memory was 127.9 MB in the beginning and 280.0 MB in the end (delta: 152.0 MB). Free memory was 105.1 MB in the beginning and 217.0 MB in the end (delta: -111.9 MB). Peak memory consumption was 40.1 MB. Max. memory is 8.0 GB. [2021-05-02 17:37:22,199 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 127.9 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 17:37:22,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.27 ms. Allocated memory is still 127.9 MB. Free memory was 104.9 MB in the beginning and 95.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-02 17:37:22,199 INFO L168 Benchmark]: Boogie Preprocessor took 46.64 ms. Allocated memory was 127.9 MB in the beginning and 194.0 MB in the end (delta: 66.1 MB). Free memory was 95.2 MB in the beginning and 177.3 MB in the end (delta: -82.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-05-02 17:37:22,199 INFO L168 Benchmark]: RCFGBuilder took 309.64 ms. Allocated memory is still 194.0 MB. Free memory was 177.3 MB in the beginning and 161.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-05-02 17:37:22,199 INFO L168 Benchmark]: IcfgTransformer took 30.43 ms. Allocated memory is still 194.0 MB. Free memory was 161.1 MB in the beginning and 159.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-02 17:37:22,199 INFO L168 Benchmark]: TraceAbstraction took 8368.87 ms. Allocated memory was 194.0 MB in the beginning and 280.0 MB in the end (delta: 86.0 MB). Free memory was 159.5 MB in the beginning and 217.0 MB in the end (delta: -57.5 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. [2021-05-02 17:37:22,199 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.09 ms. Allocated memory is still 127.9 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 144.27 ms. Allocated memory is still 127.9 MB. Free memory was 104.9 MB in the beginning and 95.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.64 ms. Allocated memory was 127.9 MB in the beginning and 194.0 MB in the end (delta: 66.1 MB). Free memory was 95.2 MB in the beginning and 177.3 MB in the end (delta: -82.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 309.64 ms. Allocated memory is still 194.0 MB. Free memory was 177.3 MB in the beginning and 161.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * IcfgTransformer took 30.43 ms. Allocated memory is still 194.0 MB. Free memory was 161.1 MB in the beginning and 159.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8368.87 ms. Allocated memory was 194.0 MB in the beginning and 280.0 MB in the end (delta: 86.0 MB). Free memory was 159.5 MB in the beginning and 217.0 MB in the end (delta: -57.5 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int MAX = __VERIFIER_nondet_uint(); [L17] COND FALSE !(!(MAX > 0)) VAL [MAX=2] [L18] char str1[MAX], str2[MAX]; [L19] int cont, i, j; [L20] cont = 0 [L22] i=0 VAL [cont=0, i=0, MAX=2, str1={3:0}, str2={7:0}] [L22] COND TRUE i= 0 [L30] EXPR str1[0] [L30] str2[j] = str1[0] [L31] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={3:0}, str2={7:0}] [L29] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={3:0}, str2={7:0}] [L29] COND TRUE i >= 0 [L30] EXPR str1[0] [L30] str2[j] = str1[0] [L31] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={3:0}, str2={7:0}] [L29] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={3:0}, str2={7:0}] [L29] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={3:0}, str2={7:0}] [L34] j = MAX-1 [L35] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={3:0}, str2={7:0}] [L35] COND TRUE i