./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/nr2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a5d4c3d8db636946363c81d25b5c2e381fc236cdcde6b4765d7ce6e059d8a21 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 10:09:22,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 10:09:22,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 10:09:22,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 10:09:22,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 10:09:22,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 10:09:22,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 10:09:22,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 10:09:22,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 10:09:22,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 10:09:22,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 10:09:22,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 10:09:22,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 10:09:22,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 10:09:22,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 10:09:22,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 10:09:22,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 10:09:22,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 10:09:22,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 10:09:22,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 10:09:22,431 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 10:09:22,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 10:09:22,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 10:09:22,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 10:09:22,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 10:09:22,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 10:09:22,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 10:09:22,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 10:09:22,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 10:09:22,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 10:09:22,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 10:09:22,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 10:09:22,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 10:09:22,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 10:09:22,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 10:09:22,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 10:09:22,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 10:09:22,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 10:09:22,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 10:09:22,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 10:09:22,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 10:09:22,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 10:09:22,444 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 10:09:22,471 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 10:09:22,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 10:09:22,472 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 10:09:22,472 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 10:09:22,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 10:09:22,473 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 10:09:22,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 10:09:22,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 10:09:22,473 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 10:09:22,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 10:09:22,474 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 10:09:22,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 10:09:22,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 10:09:22,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 10:09:22,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 10:09:22,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 10:09:22,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 10:09:22,475 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 10:09:22,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 10:09:22,475 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 10:09:22,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 10:09:22,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 10:09:22,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 10:09:22,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 10:09:22,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:09:22,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 10:09:22,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 10:09:22,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 10:09:22,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 10:09:22,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 10:09:22,489 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 10:09:22,489 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 10:09:22,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 10:09:22,489 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a5d4c3d8db636946363c81d25b5c2e381fc236cdcde6b4765d7ce6e059d8a21 [2022-07-13 10:09:22,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 10:09:22,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 10:09:22,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 10:09:22,679 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 10:09:22,680 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 10:09:22,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr2.c [2022-07-13 10:09:22,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b3ad7a6/286c621257294962a809f798b8c57d6f/FLAGf37ac9872 [2022-07-13 10:09:23,089 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 10:09:23,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr2.c [2022-07-13 10:09:23,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b3ad7a6/286c621257294962a809f798b8c57d6f/FLAGf37ac9872 [2022-07-13 10:09:23,101 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b3ad7a6/286c621257294962a809f798b8c57d6f [2022-07-13 10:09:23,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 10:09:23,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 10:09:23,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 10:09:23,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 10:09:23,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 10:09:23,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:09:23" (1/1) ... [2022-07-13 10:09:23,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6412dee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23, skipping insertion in model container [2022-07-13 10:09:23,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:09:23" (1/1) ... [2022-07-13 10:09:23,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 10:09:23,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 10:09:23,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr2.c[394,407] [2022-07-13 10:09:23,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:09:23,231 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 10:09:23,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr2.c[394,407] [2022-07-13 10:09:23,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:09:23,266 INFO L208 MainTranslator]: Completed translation [2022-07-13 10:09:23,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23 WrapperNode [2022-07-13 10:09:23,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 10:09:23,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 10:09:23,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 10:09:23,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 10:09:23,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23" (1/1) ... [2022-07-13 10:09:23,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23" (1/1) ... [2022-07-13 10:09:23,289 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2022-07-13 10:09:23,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 10:09:23,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 10:09:23,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 10:09:23,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 10:09:23,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23" (1/1) ... [2022-07-13 10:09:23,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23" (1/1) ... [2022-07-13 10:09:23,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23" (1/1) ... [2022-07-13 10:09:23,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23" (1/1) ... [2022-07-13 10:09:23,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23" (1/1) ... [2022-07-13 10:09:23,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23" (1/1) ... [2022-07-13 10:09:23,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23" (1/1) ... [2022-07-13 10:09:23,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 10:09:23,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 10:09:23,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 10:09:23,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 10:09:23,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23" (1/1) ... [2022-07-13 10:09:23,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:09:23,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:09:23,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 10:09:23,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 10:09:23,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 10:09:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 10:09:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 10:09:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 10:09:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 10:09:23,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 10:09:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 10:09:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 10:09:23,396 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 10:09:23,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 10:09:23,495 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 10:09:23,499 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 10:09:23,499 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 10:09:23,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:09:23 BoogieIcfgContainer [2022-07-13 10:09:23,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 10:09:23,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 10:09:23,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 10:09:23,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 10:09:23,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:09:23" (1/3) ... [2022-07-13 10:09:23,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f9bb68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:09:23, skipping insertion in model container [2022-07-13 10:09:23,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:23" (2/3) ... [2022-07-13 10:09:23,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f9bb68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:09:23, skipping insertion in model container [2022-07-13 10:09:23,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:09:23" (3/3) ... [2022-07-13 10:09:23,515 INFO L111 eAbstractionObserver]: Analyzing ICFG nr2.c [2022-07-13 10:09:23,532 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 10:09:23,543 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 10:09:23,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 10:09:23,595 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d71647b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c0c279e [2022-07-13 10:09:23,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 10:09:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 10:09:23,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:23,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:23,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash -405965127, now seen corresponding path program 1 times [2022-07-13 10:09:23,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:23,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107973735] [2022-07-13 10:09:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:23,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:23,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107973735] [2022-07-13 10:09:23,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107973735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:09:23,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:09:23,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 10:09:23,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020676223] [2022-07-13 10:09:23,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:09:23,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 10:09:23,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:23,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 10:09:23,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:09:23,816 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:23,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:23,828 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-13 10:09:23,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 10:09:23,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 10:09:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:23,835 INFO L225 Difference]: With dead ends: 45 [2022-07-13 10:09:23,835 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 10:09:23,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:09:23,839 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:23,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:09:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 10:09:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 10:09:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-13 10:09:23,859 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-07-13 10:09:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:23,859 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-13 10:09:23,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-13 10:09:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 10:09:23,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:23,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:23,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 10:09:23,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:23,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash 274093243, now seen corresponding path program 1 times [2022-07-13 10:09:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:23,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868135628] [2022-07-13 10:09:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:23,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868135628] [2022-07-13 10:09:23,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868135628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:09:23,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:09:23,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 10:09:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76143341] [2022-07-13 10:09:23,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:09:23,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 10:09:23,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:23,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 10:09:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:09:23,923 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:23,946 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-07-13 10:09:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:09:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 10:09:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:23,948 INFO L225 Difference]: With dead ends: 29 [2022-07-13 10:09:23,948 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 10:09:23,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:09:23,950 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:23,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:09:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 10:09:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-13 10:09:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-13 10:09:23,957 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-13 10:09:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:23,957 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-13 10:09:23,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-13 10:09:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 10:09:23,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:23,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:23,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 10:09:23,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:23,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash 274152825, now seen corresponding path program 1 times [2022-07-13 10:09:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:23,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279953691] [2022-07-13 10:09:23,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:23,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:24,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:24,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279953691] [2022-07-13 10:09:24,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279953691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:09:24,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:09:24,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 10:09:24,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599533736] [2022-07-13 10:09:24,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:09:24,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 10:09:24,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:24,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 10:09:24,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:09:24,111 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:24,143 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-13 10:09:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:09:24,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 10:09:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:24,144 INFO L225 Difference]: With dead ends: 38 [2022-07-13 10:09:24,144 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 10:09:24,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:09:24,145 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:24,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:09:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 10:09:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-13 10:09:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-13 10:09:24,149 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-07-13 10:09:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:24,150 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-13 10:09:24,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-13 10:09:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 10:09:24,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:24,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:24,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 10:09:24,151 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:24,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:24,151 INFO L85 PathProgramCache]: Analyzing trace with hash -715167033, now seen corresponding path program 1 times [2022-07-13 10:09:24,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:24,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508573735] [2022-07-13 10:09:24,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:24,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:24,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508573735] [2022-07-13 10:09:24,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508573735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:09:24,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:09:24,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 10:09:24,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160290502] [2022-07-13 10:09:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:09:24,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 10:09:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:24,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 10:09:24,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:09:24,176 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:24,188 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-07-13 10:09:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 10:09:24,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 10:09:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:24,189 INFO L225 Difference]: With dead ends: 42 [2022-07-13 10:09:24,189 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 10:09:24,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:09:24,190 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:24,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:09:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 10:09:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-07-13 10:09:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-13 10:09:24,197 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-13 10:09:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:24,197 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-13 10:09:24,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-13 10:09:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 10:09:24,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:24,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:24,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 10:09:24,199 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:24,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:24,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1618667584, now seen corresponding path program 1 times [2022-07-13 10:09:24,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:24,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464754416] [2022-07-13 10:09:24,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:24,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:24,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:24,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464754416] [2022-07-13 10:09:24,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464754416] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:09:24,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270913121] [2022-07-13 10:09:24,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:24,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:09:24,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:09:24,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:09:24,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 10:09:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:24,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 10:09:24,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:09:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:24,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:09:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:24,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270913121] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:09:24,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:09:24,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-13 10:09:24,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054985209] [2022-07-13 10:09:24,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:09:24,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 10:09:24,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:24,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 10:09:24,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:09:24,359 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:24,380 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-07-13 10:09:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 10:09:24,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 10:09:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:24,382 INFO L225 Difference]: With dead ends: 44 [2022-07-13 10:09:24,382 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 10:09:24,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:09:24,383 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:24,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 52 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:09:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 10:09:24,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-13 10:09:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-07-13 10:09:24,387 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 19 [2022-07-13 10:09:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:24,387 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-07-13 10:09:24,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-07-13 10:09:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 10:09:24,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:24,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:24,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 10:09:24,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:09:24,605 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:24,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:24,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1955154983, now seen corresponding path program 2 times [2022-07-13 10:09:24,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:24,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769081148] [2022-07-13 10:09:24,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:24,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:24,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769081148] [2022-07-13 10:09:24,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769081148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:09:24,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373051725] [2022-07-13 10:09:24,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:09:24,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:09:24,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:09:24,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:09:24,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 10:09:24,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:09:24,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:09:24,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 10:09:24,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:09:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:24,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 10:09:24,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373051725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:09:24,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 10:09:24,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-07-13 10:09:24,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239217807] [2022-07-13 10:09:24,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:09:24,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 10:09:24,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:24,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 10:09:24,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-13 10:09:24,731 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:24,747 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-07-13 10:09:24,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:09:24,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 10:09:24,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:24,748 INFO L225 Difference]: With dead ends: 47 [2022-07-13 10:09:24,748 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 10:09:24,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-13 10:09:24,749 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:24,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:09:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 10:09:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-13 10:09:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-13 10:09:24,753 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 22 [2022-07-13 10:09:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:24,753 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-13 10:09:24,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-13 10:09:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 10:09:24,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:24,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:24,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 10:09:24,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 10:09:24,973 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1638747735, now seen corresponding path program 1 times [2022-07-13 10:09:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:24,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260286853] [2022-07-13 10:09:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:24,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:25,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:25,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260286853] [2022-07-13 10:09:25,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260286853] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:09:25,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150073336] [2022-07-13 10:09:25,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:25,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:09:25,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:09:25,197 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:09:25,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 10:09:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:25,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 10:09:25,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:09:25,330 INFO L390 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 18 treesize of output 14 [2022-07-13 10:09:25,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:09:25,391 INFO L390 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 24 treesize of output 23 [2022-07-13 10:09:25,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-07-13 10:09:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:25,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:09:37,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 25 [2022-07-13 10:09:37,608 INFO L390 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 196 treesize of output 192 [2022-07-13 10:09:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:39,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150073336] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:09:39,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:09:39,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-07-13 10:09:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636841491] [2022-07-13 10:09:39,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:09:39,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 10:09:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:39,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 10:09:39,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=470, Unknown=3, NotChecked=0, Total=600 [2022-07-13 10:09:39,699 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:39,956 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2022-07-13 10:09:39,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 10:09:39,956 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 10:09:39,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:39,957 INFO L225 Difference]: With dead ends: 91 [2022-07-13 10:09:39,957 INFO L226 Difference]: Without dead ends: 71 [2022-07-13 10:09:39,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=235, Invalid=818, Unknown=3, NotChecked=0, Total=1056 [2022-07-13 10:09:39,958 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 187 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:39,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 140 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 243 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2022-07-13 10:09:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-13 10:09:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2022-07-13 10:09:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-13 10:09:39,963 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-07-13 10:09:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:39,963 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-13 10:09:39,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-07-13 10:09:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 10:09:39,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:39,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:39,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 10:09:40,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:09:40,165 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -565805188, now seen corresponding path program 1 times [2022-07-13 10:09:40,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:40,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539109523] [2022-07-13 10:09:40,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:40,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:40,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539109523] [2022-07-13 10:09:40,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539109523] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:09:40,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122443067] [2022-07-13 10:09:40,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:40,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:09:40,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:09:40,374 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:09:40,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 10:09:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:40,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 10:09:40,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:09:40,462 INFO L390 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 16 treesize of output 12 [2022-07-13 10:09:40,605 INFO L356 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-07-13 10:09:40,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 20 [2022-07-13 10:09:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:40,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:09:40,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 17 [2022-07-13 10:09:40,678 INFO L390 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 34 treesize of output 30 [2022-07-13 10:09:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:40,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122443067] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:09:40,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:09:40,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 27 [2022-07-13 10:09:40,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836259783] [2022-07-13 10:09:40,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:09:40,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 10:09:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:40,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 10:09:40,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2022-07-13 10:09:40,748 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:41,131 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-07-13 10:09:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 10:09:41,131 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-13 10:09:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:41,132 INFO L225 Difference]: With dead ends: 102 [2022-07-13 10:09:41,132 INFO L226 Difference]: Without dead ends: 100 [2022-07-13 10:09:41,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=1942, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 10:09:41,133 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 181 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:41,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 142 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 282 Invalid, 0 Unknown, 3 Unchecked, 0.1s Time] [2022-07-13 10:09:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-13 10:09:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 59. [2022-07-13 10:09:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-07-13 10:09:41,143 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 28 [2022-07-13 10:09:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:41,143 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-07-13 10:09:41,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-07-13 10:09:41,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 10:09:41,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:41,146 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:41,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 10:09:41,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:09:41,359 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:41,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:41,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1346440327, now seen corresponding path program 2 times [2022-07-13 10:09:41,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:41,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561000786] [2022-07-13 10:09:41,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:41,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:41,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:41,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561000786] [2022-07-13 10:09:41,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561000786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:09:41,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184441358] [2022-07-13 10:09:41,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:09:41,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:09:41,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:09:41,696 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:09:41,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 10:09:41,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:09:41,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:09:41,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 10:09:41,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:09:41,801 INFO L390 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 16 treesize of output 12 [2022-07-13 10:09:41,837 INFO L356 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2022-07-13 10:09:41,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-07-13 10:09:41,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:09:42,003 INFO L356 Elim1Store]: treesize reduction 45, result has 36.6 percent of original size [2022-07-13 10:09:42,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 60 [2022-07-13 10:09:44,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:09:44,108 INFO L390 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 34 treesize of output 29 [2022-07-13 10:09:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:44,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:10:32,020 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_27| Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_27| 2)) (forall ((|v_ULTIMATE.start_main_~j~0#1_26| Int) (v_ArrVal_86 Int) (v_ArrVal_84 Int)) (let ((.cse0 (select (let ((.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_27| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_84) (+ (* |v_ULTIMATE.start_main_~j~0#1_26| (- 4)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_86)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (= .cse0 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_26| 1) |v_ULTIMATE.start_main_~j~0#1_27|))))))) is different from false [2022-07-13 10:10:58,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 95 treesize of output 91 [2022-07-13 10:10:58,841 INFO L390 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 6831 treesize of output 6799 [2022-07-13 10:12:17,062 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 10:12:17,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 10:12:17,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:12:17,263 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:545) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 10:12:17,270 INFO L158 Benchmark]: Toolchain (without parser) took 174163.09ms. Allocated memory was 90.2MB in the beginning and 721.4MB in the end (delta: 631.2MB). Free memory was 64.3MB in the beginning and 513.5MB in the end (delta: -449.2MB). Peak memory consumption was 435.4MB. Max. memory is 16.1GB. [2022-07-13 10:12:17,270 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory was 61.2MB in the beginning and 61.2MB in the end (delta: 49.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 10:12:17,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.69ms. Allocated memory is still 90.2MB. Free memory was 64.2MB in the beginning and 54.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 10:12:17,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.44ms. Allocated memory is still 90.2MB. Free memory was 53.9MB in the beginning and 52.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 10:12:17,271 INFO L158 Benchmark]: Boogie Preprocessor took 13.86ms. Allocated memory is still 90.2MB. Free memory was 52.3MB in the beginning and 51.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 10:12:17,271 INFO L158 Benchmark]: RCFGBuilder took 196.01ms. Allocated memory is still 90.2MB. Free memory was 51.0MB in the beginning and 40.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 10:12:17,272 INFO L158 Benchmark]: TraceAbstraction took 173764.73ms. Allocated memory was 90.2MB in the beginning and 721.4MB in the end (delta: 631.2MB). Free memory was 40.0MB in the beginning and 513.5MB in the end (delta: -473.6MB). Peak memory consumption was 412.3MB. Max. memory is 16.1GB. [2022-07-13 10:12:17,274 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.14ms. Allocated memory is still 90.2MB. Free memory was 61.2MB in the beginning and 61.2MB in the end (delta: 49.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.69ms. Allocated memory is still 90.2MB. Free memory was 64.2MB in the beginning and 54.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.44ms. Allocated memory is still 90.2MB. Free memory was 53.9MB in the beginning and 52.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.86ms. Allocated memory is still 90.2MB. Free memory was 52.3MB in the beginning and 51.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 196.01ms. Allocated memory is still 90.2MB. Free memory was 51.0MB in the beginning and 40.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 173764.73ms. Allocated memory was 90.2MB in the beginning and 721.4MB in the end (delta: 631.2MB). Free memory was 40.0MB in the beginning and 513.5MB in the end (delta: -473.6MB). Peak memory consumption was 412.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 10:12:17,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/nr2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a5d4c3d8db636946363c81d25b5c2e381fc236cdcde6b4765d7ce6e059d8a21 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 10:12:18,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 10:12:18,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 10:12:18,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 10:12:18,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 10:12:18,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 10:12:18,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 10:12:18,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 10:12:18,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 10:12:18,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 10:12:18,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 10:12:18,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 10:12:18,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 10:12:18,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 10:12:18,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 10:12:18,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 10:12:18,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 10:12:18,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 10:12:18,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 10:12:18,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 10:12:18,903 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 10:12:18,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 10:12:18,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 10:12:18,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 10:12:18,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 10:12:18,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 10:12:18,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 10:12:18,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 10:12:18,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 10:12:18,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 10:12:18,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 10:12:18,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 10:12:18,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 10:12:18,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 10:12:18,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 10:12:18,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 10:12:18,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 10:12:18,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 10:12:18,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 10:12:18,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 10:12:18,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 10:12:18,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 10:12:18,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 10:12:18,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 10:12:18,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 10:12:18,948 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 10:12:18,948 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 10:12:18,948 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 10:12:18,948 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 10:12:18,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 10:12:18,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 10:12:18,949 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 10:12:18,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 10:12:18,950 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 10:12:18,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 10:12:18,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 10:12:18,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 10:12:18,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 10:12:18,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 10:12:18,951 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 10:12:18,951 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 10:12:18,952 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 10:12:18,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 10:12:18,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 10:12:18,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 10:12:18,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 10:12:18,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 10:12:18,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 10:12:18,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 10:12:18,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:12:18,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 10:12:18,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 10:12:18,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 10:12:18,954 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 10:12:18,954 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 10:12:18,954 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 10:12:18,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 10:12:18,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 10:12:18,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 10:12:18,955 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a5d4c3d8db636946363c81d25b5c2e381fc236cdcde6b4765d7ce6e059d8a21 [2022-07-13 10:12:19,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 10:12:19,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 10:12:19,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 10:12:19,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 10:12:19,222 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 10:12:19,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr2.c [2022-07-13 10:12:19,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8b20a25/0dc87fe218b8469887e3a8f2b9837a9b/FLAG1c8710a72 [2022-07-13 10:12:19,566 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 10:12:19,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr2.c [2022-07-13 10:12:19,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8b20a25/0dc87fe218b8469887e3a8f2b9837a9b/FLAG1c8710a72 [2022-07-13 10:12:20,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8b20a25/0dc87fe218b8469887e3a8f2b9837a9b [2022-07-13 10:12:20,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 10:12:20,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 10:12:20,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 10:12:20,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 10:12:20,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 10:12:20,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:12:20" (1/1) ... [2022-07-13 10:12:20,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@288f5844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20, skipping insertion in model container [2022-07-13 10:12:20,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:12:20" (1/1) ... [2022-07-13 10:12:20,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 10:12:20,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 10:12:20,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr2.c[394,407] [2022-07-13 10:12:20,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:12:20,136 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 10:12:20,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr2.c[394,407] [2022-07-13 10:12:20,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:12:20,180 INFO L208 MainTranslator]: Completed translation [2022-07-13 10:12:20,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20 WrapperNode [2022-07-13 10:12:20,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 10:12:20,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 10:12:20,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 10:12:20,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 10:12:20,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20" (1/1) ... [2022-07-13 10:12:20,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20" (1/1) ... [2022-07-13 10:12:20,217 INFO L137 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-07-13 10:12:20,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 10:12:20,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 10:12:20,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 10:12:20,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 10:12:20,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20" (1/1) ... [2022-07-13 10:12:20,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20" (1/1) ... [2022-07-13 10:12:20,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20" (1/1) ... [2022-07-13 10:12:20,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20" (1/1) ... [2022-07-13 10:12:20,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20" (1/1) ... [2022-07-13 10:12:20,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20" (1/1) ... [2022-07-13 10:12:20,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20" (1/1) ... [2022-07-13 10:12:20,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 10:12:20,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 10:12:20,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 10:12:20,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 10:12:20,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20" (1/1) ... [2022-07-13 10:12:20,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:12:20,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:12:20,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 10:12:20,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 10:12:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 10:12:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 10:12:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 10:12:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 10:12:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 10:12:20,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 10:12:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 10:12:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 10:12:20,332 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 10:12:20,334 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 10:12:20,509 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 10:12:20,513 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 10:12:20,513 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 10:12:20,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:12:20 BoogieIcfgContainer [2022-07-13 10:12:20,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 10:12:20,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 10:12:20,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 10:12:20,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 10:12:20,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:12:20" (1/3) ... [2022-07-13 10:12:20,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347e9d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:12:20, skipping insertion in model container [2022-07-13 10:12:20,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:12:20" (2/3) ... [2022-07-13 10:12:20,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347e9d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:12:20, skipping insertion in model container [2022-07-13 10:12:20,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:12:20" (3/3) ... [2022-07-13 10:12:20,520 INFO L111 eAbstractionObserver]: Analyzing ICFG nr2.c [2022-07-13 10:12:20,534 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 10:12:20,547 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 10:12:20,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 10:12:20,604 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60aa6115, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b413cd6 [2022-07-13 10:12:20,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 10:12:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:20,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 10:12:20,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:20,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:20,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:20,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash -405965127, now seen corresponding path program 1 times [2022-07-13 10:12:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:12:20,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491054318] [2022-07-13 10:12:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:12:20,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:12:20,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:12:20,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:12:20,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 10:12:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:12:20,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 10:12:20,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:20,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 10:12:20,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:12:20,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491054318] [2022-07-13 10:12:20,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491054318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:12:20,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:12:20,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 10:12:20,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977523129] [2022-07-13 10:12:20,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:12:20,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 10:12:20,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:12:20,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 10:12:20,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:12:20,722 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:20,731 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-13 10:12:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 10:12:20,733 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 10:12:20,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:20,737 INFO L225 Difference]: With dead ends: 45 [2022-07-13 10:12:20,738 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 10:12:20,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:12:20,742 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:20,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:12:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 10:12:20,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 10:12:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-13 10:12:20,760 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-07-13 10:12:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:20,761 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-13 10:12:20,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-13 10:12:20,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 10:12:20,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:20,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:20,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 10:12:20,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:12:20,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:20,969 INFO L85 PathProgramCache]: Analyzing trace with hash 274093243, now seen corresponding path program 1 times [2022-07-13 10:12:20,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:12:20,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882153262] [2022-07-13 10:12:20,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:12:20,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:12:20,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:12:20,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:12:20,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 10:12:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:12:21,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 10:12:21,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:21,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 10:12:21,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:12:21,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882153262] [2022-07-13 10:12:21,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882153262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:12:21,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:12:21,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 10:12:21,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189025516] [2022-07-13 10:12:21,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:12:21,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 10:12:21,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:12:21,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 10:12:21,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:12:21,102 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:21,183 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-07-13 10:12:21,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 10:12:21,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 10:12:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:21,185 INFO L225 Difference]: With dead ends: 34 [2022-07-13 10:12:21,185 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 10:12:21,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:12:21,186 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:21,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 27 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:12:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 10:12:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-13 10:12:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-13 10:12:21,189 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2022-07-13 10:12:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:21,189 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-13 10:12:21,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-07-13 10:12:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 10:12:21,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:21,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:21,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-13 10:12:21,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:12:21,397 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:21,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:21,397 INFO L85 PathProgramCache]: Analyzing trace with hash -715226615, now seen corresponding path program 1 times [2022-07-13 10:12:21,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:12:21,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716918631] [2022-07-13 10:12:21,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:12:21,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:12:21,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:12:21,399 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:12:21,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 10:12:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:12:21,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 10:12:21,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:21,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 10:12:21,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:12:21,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716918631] [2022-07-13 10:12:21,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716918631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:12:21,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:12:21,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 10:12:21,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854716643] [2022-07-13 10:12:21,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:12:21,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 10:12:21,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:12:21,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 10:12:21,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:12:21,442 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:21,460 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-07-13 10:12:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 10:12:21,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 10:12:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:21,461 INFO L225 Difference]: With dead ends: 38 [2022-07-13 10:12:21,461 INFO L226 Difference]: Without dead ends: 24 [2022-07-13 10:12:21,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:12:21,462 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:21,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:12:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-13 10:12:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-07-13 10:12:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-13 10:12:21,465 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-07-13 10:12:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:21,466 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-13 10:12:21,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-13 10:12:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 10:12:21,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:21,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:21,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 10:12:21,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:12:21,673 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:21,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:21,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1618608002, now seen corresponding path program 1 times [2022-07-13 10:12:21,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:12:21,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479216911] [2022-07-13 10:12:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:12:21,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:12:21,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:12:21,675 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:12:21,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 10:12:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:12:21,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 10:12:21,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:21,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:12:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:21,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:12:21,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479216911] [2022-07-13 10:12:21,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479216911] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:12:21,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:12:21,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-13 10:12:21,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634144492] [2022-07-13 10:12:21,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:12:21,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 10:12:21,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:12:21,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 10:12:21,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 10:12:21,762 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:21,821 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-07-13 10:12:21,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:12:21,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 10:12:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:21,824 INFO L225 Difference]: With dead ends: 42 [2022-07-13 10:12:21,824 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 10:12:21,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 10:12:21,828 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:21,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:12:21,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 10:12:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-07-13 10:12:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-07-13 10:12:21,840 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2022-07-13 10:12:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:21,840 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-07-13 10:12:21,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-07-13 10:12:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 10:12:21,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:21,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:21,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 10:12:22,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:12:22,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:22,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:22,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1955095401, now seen corresponding path program 2 times [2022-07-13 10:12:22,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:12:22,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880099167] [2022-07-13 10:12:22,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:12:22,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:12:22,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:12:22,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:12:22,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 10:12:22,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 10:12:22,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:12:22,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 10:12:22,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 10:12:22,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 10:12:22,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:12:22,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880099167] [2022-07-13 10:12:22,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880099167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:12:22,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:12:22,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 10:12:22,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281838622] [2022-07-13 10:12:22,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:12:22,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 10:12:22,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:12:22,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 10:12:22,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:12:22,094 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:22,114 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-07-13 10:12:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:12:22,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 10:12:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:22,115 INFO L225 Difference]: With dead ends: 35 [2022-07-13 10:12:22,115 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 10:12:22,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:12:22,116 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:22,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:12:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 10:12:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-07-13 10:12:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-07-13 10:12:22,119 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 22 [2022-07-13 10:12:22,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:22,120 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-07-13 10:12:22,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:22,120 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-07-13 10:12:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 10:12:22,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:22,120 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:22,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 10:12:22,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:12:22,326 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:22,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:22,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1955154983, now seen corresponding path program 1 times [2022-07-13 10:12:22,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:12:22,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386619147] [2022-07-13 10:12:22,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:12:22,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:12:22,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:12:22,328 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:12:22,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 10:12:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:12:22,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 10:12:22,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:22,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:12:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:22,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:12:22,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386619147] [2022-07-13 10:12:22,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386619147] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:12:22,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:12:22,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-13 10:12:22,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628956645] [2022-07-13 10:12:22,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:12:22,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 10:12:22,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:12:22,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 10:12:22,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-13 10:12:22,442 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:22,530 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-07-13 10:12:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 10:12:22,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 10:12:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:22,531 INFO L225 Difference]: With dead ends: 47 [2022-07-13 10:12:22,532 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 10:12:22,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-13 10:12:22,532 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 64 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:22,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 50 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:12:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 10:12:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-13 10:12:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-13 10:12:22,535 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 22 [2022-07-13 10:12:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:22,535 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-13 10:12:22,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-13 10:12:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 10:12:22,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:22,536 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:22,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 10:12:22,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:12:22,736 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1638747735, now seen corresponding path program 1 times [2022-07-13 10:12:22,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:12:22,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343192676] [2022-07-13 10:12:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:12:22,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:12:22,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:12:22,738 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:12:22,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 10:12:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:12:22,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 10:12:22,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:22,861 INFO L390 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 19 treesize of output 15 [2022-07-13 10:12:22,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:22,960 INFO L390 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 21 treesize of output 20 [2022-07-13 10:12:23,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-07-13 10:12:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:23,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:12:23,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 29 [2022-07-13 10:12:23,252 INFO L390 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 222 treesize of output 218 [2022-07-13 10:12:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:23,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:12:23,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343192676] [2022-07-13 10:12:23,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343192676] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:12:23,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:12:23,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-07-13 10:12:23,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225991009] [2022-07-13 10:12:23,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:12:23,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 10:12:23,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:12:23,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 10:12:23,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-13 10:12:23,494 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:23,929 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-07-13 10:12:23,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 10:12:23,932 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 10:12:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:23,932 INFO L225 Difference]: With dead ends: 99 [2022-07-13 10:12:23,932 INFO L226 Difference]: Without dead ends: 89 [2022-07-13 10:12:23,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-07-13 10:12:23,933 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 105 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:23,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 154 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 140 Invalid, 0 Unknown, 104 Unchecked, 0.2s Time] [2022-07-13 10:12:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-13 10:12:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 42. [2022-07-13 10:12:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-07-13 10:12:23,938 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 22 [2022-07-13 10:12:23,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:23,938 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-07-13 10:12:23,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:23,938 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-07-13 10:12:23,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 10:12:23,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:23,939 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:23,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 10:12:24,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:12:24,145 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash 271931977, now seen corresponding path program 2 times [2022-07-13 10:12:24,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:12:24,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750979582] [2022-07-13 10:12:24,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:12:24,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:12:24,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:12:24,147 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:12:24,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 10:12:24,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:12:24,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:12:24,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 10:12:24,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 10:12:24,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:12:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 10:12:24,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:12:24,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750979582] [2022-07-13 10:12:24,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750979582] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:12:24,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:12:24,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-13 10:12:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324362403] [2022-07-13 10:12:24,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:12:24,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 10:12:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:12:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 10:12:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 10:12:24,256 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:24,311 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-07-13 10:12:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:12:24,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-13 10:12:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:24,318 INFO L225 Difference]: With dead ends: 67 [2022-07-13 10:12:24,318 INFO L226 Difference]: Without dead ends: 39 [2022-07-13 10:12:24,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 10:12:24,319 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:24,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:12:24,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-13 10:12:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-13 10:12:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-07-13 10:12:24,323 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 28 [2022-07-13 10:12:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:24,323 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-13 10:12:24,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-07-13 10:12:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 10:12:24,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:24,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:24,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 10:12:24,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:12:24,524 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:24,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash -565805188, now seen corresponding path program 1 times [2022-07-13 10:12:24,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:12:24,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000356370] [2022-07-13 10:12:24,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:12:24,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:12:24,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:12:24,526 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:12:24,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 10:12:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:12:24,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 10:12:24,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:24,623 INFO L390 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 13 treesize of output 9 [2022-07-13 10:12:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:24,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:12:24,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 18 [2022-07-13 10:12:24,816 INFO L390 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 36 treesize of output 32 [2022-07-13 10:12:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:24,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:12:24,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000356370] [2022-07-13 10:12:24,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000356370] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:12:24,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:12:24,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-07-13 10:12:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291593676] [2022-07-13 10:12:24,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:12:24,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 10:12:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:12:24,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 10:12:24,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-13 10:12:24,919 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:25,463 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-07-13 10:12:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 10:12:25,464 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-13 10:12:25,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:25,464 INFO L225 Difference]: With dead ends: 81 [2022-07-13 10:12:25,464 INFO L226 Difference]: Without dead ends: 79 [2022-07-13 10:12:25,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=834, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 10:12:25,465 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 157 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:25,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 160 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 10:12:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-13 10:12:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 45. [2022-07-13 10:12:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-07-13 10:12:25,478 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 28 [2022-07-13 10:12:25,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:25,478 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-07-13 10:12:25,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-07-13 10:12:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 10:12:25,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:25,483 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:25,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 10:12:25,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:12:25,689 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:25,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1346440327, now seen corresponding path program 3 times [2022-07-13 10:12:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:12:25,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667097421] [2022-07-13 10:12:25,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 10:12:25,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:12:25,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:12:25,691 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:12:25,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 10:12:25,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 10:12:25,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:12:25,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 10:12:25,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:25,824 INFO L390 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 19 treesize of output 15 [2022-07-13 10:12:25,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:25,922 INFO L390 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 29 treesize of output 28 [2022-07-13 10:12:26,017 INFO L356 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-07-13 10:12:26,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 40 [2022-07-13 10:12:26,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:26,179 INFO L390 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 36 treesize of output 35 [2022-07-13 10:12:26,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-07-13 10:12:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:26,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:12:33,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 57 treesize of output 55 [2022-07-13 10:12:33,691 INFO L390 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 8464 treesize of output 8432 [2022-07-13 10:12:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:12:43,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:12:43,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667097421] [2022-07-13 10:12:43,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667097421] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:12:43,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:12:43,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-07-13 10:12:43,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352419335] [2022-07-13 10:12:43,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:12:43,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 10:12:43,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:12:43,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 10:12:43,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=554, Unknown=4, NotChecked=0, Total=702 [2022-07-13 10:12:43,578 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:45,805 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (or (= (select .cse0 (bvadd (_ bv4294967280 32) (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (_ bv2 32)) (= (bvadd (_ bv16 32) (bvmul (bvneg (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))) (_ bv4 32))) (_ bv0 32))) (= (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~i~0#1|) (_ bv1 32)) (bvsge (select .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_66 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32)) (|ULTIMATE.start_main_~j~0#1| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) (or (not (bvsge .cse1 (_ bv1 32))) (bvsge .cse1 |c_ULTIMATE.start_main_~MINVAL~0#1|) (bvsge (select (let ((.cse2 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (bvadd (_ bv8 32) (bvmul (bvneg |ULTIMATE.start_main_~j~0#1|) (_ bv4 32)) .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_66) (bvadd (_ bv8 32) .cse2 (bvmul (_ bv4 32) (bvneg .cse1)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_67)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (= (_ bv2 32) |c_ULTIMATE.start_main_~MINVAL~0#1|))) is different from false [2022-07-13 10:12:47,818 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (or (= (select .cse0 (bvadd (_ bv4294967280 32) (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (_ bv2 32)) (= (bvadd (_ bv16 32) (bvmul (bvneg (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))) (_ bv4 32))) (_ bv0 32))) (= (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~i~0#1|) (_ bv1 32)) (= (_ bv2 32) (select .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_66 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32)) (|ULTIMATE.start_main_~j~0#1| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) (or (not (bvsge .cse1 (_ bv1 32))) (bvsge .cse1 |c_ULTIMATE.start_main_~MINVAL~0#1|) (bvsge (select (let ((.cse2 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (bvadd (_ bv8 32) (bvmul (bvneg |ULTIMATE.start_main_~j~0#1|) (_ bv4 32)) .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_66) (bvadd (_ bv8 32) .cse2 (bvmul (_ bv4 32) (bvneg .cse1)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_67)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (= (_ bv2 32) |c_ULTIMATE.start_main_~MINVAL~0#1|))) is different from false [2022-07-13 10:12:49,835 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_66 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32)) (|ULTIMATE.start_main_~j~0#1| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) (or (not (bvsge .cse0 (_ bv1 32))) (bvsge .cse0 |c_ULTIMATE.start_main_~MINVAL~0#1|) (bvsge (select (let ((.cse1 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (bvadd (_ bv8 32) (bvmul (bvneg |ULTIMATE.start_main_~j~0#1|) (_ bv4 32)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_66) (bvadd (_ bv8 32) .cse1 (bvmul (_ bv4 32) (bvneg .cse0)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_67)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (= (_ bv2 32) |c_ULTIMATE.start_main_~MINVAL~0#1|)) is different from false [2022-07-13 10:12:51,848 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |c_ULTIMATE.start_main_~MINVAL~0#1|) (forall ((|ULTIMATE.start_main_~j~0#1| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) (or (forall ((v_ArrVal_66 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (bvsge (select (let ((.cse0 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (bvadd (bvmul (bvneg |ULTIMATE.start_main_~j~0#1|) (_ bv4 32)) .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_66) (bvadd .cse0 (bvmul (_ bv4 32) (bvneg (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_67)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|)) (not (bvsge .cse1 (_ bv1 32))) (bvsge .cse1 |c_ULTIMATE.start_main_~MINVAL~0#1|))))) is different from false [2022-07-13 10:12:53,893 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_67 (_ BitVec 32))) (bvsge (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (bvadd (bvmul (_ bv4 32) (bvneg |c_ULTIMATE.start_main_~j~0#1|)) (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_67) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|)) (bvsge |c_ULTIMATE.start_main_~j~0#1| |c_ULTIMATE.start_main_~MINVAL~0#1|)) (forall ((|ULTIMATE.start_main_~j~0#1| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) (or (forall ((v_ArrVal_66 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (bvsge (select (let ((.cse0 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (bvadd (bvmul (bvneg |ULTIMATE.start_main_~j~0#1|) (_ bv4 32)) .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_66) (bvadd .cse0 (bvmul (_ bv4 32) (bvneg (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_67)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|)) (not (bvsge .cse1 (_ bv1 32))) (bvsge .cse1 |c_ULTIMATE.start_main_~MINVAL~0#1|))))) is different from false [2022-07-13 10:12:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:54,079 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2022-07-13 10:12:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 10:12:54,080 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-13 10:12:54,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:54,080 INFO L225 Difference]: With dead ends: 117 [2022-07-13 10:12:54,080 INFO L226 Difference]: Without dead ends: 107 [2022-07-13 10:12:54,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=223, Invalid=910, Unknown=9, NotChecked=340, Total=1482 [2022-07-13 10:12:54,083 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:54,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 170 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 143 Invalid, 0 Unknown, 277 Unchecked, 0.2s Time] [2022-07-13 10:12:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-13 10:12:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 66. [2022-07-13 10:12:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 65 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-07-13 10:12:54,090 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 31 [2022-07-13 10:12:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:54,090 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-07-13 10:12:54,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-07-13 10:12:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 10:12:54,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:54,091 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:54,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 10:12:54,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:12:54,298 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:54,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:54,298 INFO L85 PathProgramCache]: Analyzing trace with hash 321872655, now seen corresponding path program 2 times [2022-07-13 10:12:54,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:12:54,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151280381] [2022-07-13 10:12:54,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:12:54,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:12:54,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:12:54,299 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:12:54,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 10:12:54,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:12:54,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:12:54,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 10:12:54,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 10:12:55,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:12:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 10:12:56,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:12:56,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151280381] [2022-07-13 10:12:56,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151280381] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:12:56,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:12:56,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2022-07-13 10:12:56,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280524477] [2022-07-13 10:12:56,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:12:56,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 10:12:56,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:12:56,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 10:12:56,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-13 10:12:56,959 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:58,026 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-07-13 10:12:58,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 10:12:58,029 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-13 10:12:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:58,030 INFO L225 Difference]: With dead ends: 101 [2022-07-13 10:12:58,030 INFO L226 Difference]: Without dead ends: 77 [2022-07-13 10:12:58,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-07-13 10:12:58,031 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 164 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:58,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 137 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 10:12:58,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-13 10:12:58,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2022-07-13 10:12:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-07-13 10:12:58,037 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2022-07-13 10:12:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:58,038 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-07-13 10:12:58,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-07-13 10:12:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 10:12:58,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:58,039 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:58,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 10:12:58,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:12:58,247 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:58,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:58,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1630657204, now seen corresponding path program 3 times [2022-07-13 10:12:58,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:12:58,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605379680] [2022-07-13 10:12:58,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 10:12:58,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:12:58,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:12:58,248 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:12:58,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 10:12:58,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 10:12:58,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:12:58,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 10:12:58,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:58,385 INFO L390 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 13 treesize of output 9 [2022-07-13 10:12:58,459 INFO L356 Elim1Store]: treesize reduction 28, result has 41.7 percent of original size [2022-07-13 10:12:58,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 39 [2022-07-13 10:12:58,591 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-07-13 10:12:58,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-13 10:12:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:12:58,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:12:59,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 44 treesize of output 42 [2022-07-13 10:12:59,380 INFO L390 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 754 treesize of output 738 [2022-07-13 10:13:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:13:02,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:13:02,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605379680] [2022-07-13 10:13:02,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605379680] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:13:02,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:13:02,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-07-13 10:13:02,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208630714] [2022-07-13 10:13:02,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:13:02,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 10:13:02,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:13:02,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 10:13:02,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=572, Unknown=1, NotChecked=0, Total=702 [2022-07-13 10:13:02,809 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:13:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:13:03,487 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-07-13 10:13:03,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 10:13:03,487 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-13 10:13:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:13:03,488 INFO L225 Difference]: With dead ends: 89 [2022-07-13 10:13:03,488 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 10:13:03,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=438, Invalid=1367, Unknown=1, NotChecked=0, Total=1806 [2022-07-13 10:13:03,489 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 125 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:13:03,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 150 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 243 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2022-07-13 10:13:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 10:13:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2022-07-13 10:13:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:13:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-07-13 10:13:03,495 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 37 [2022-07-13 10:13:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:13:03,495 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-07-13 10:13:03,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:13:03,496 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-07-13 10:13:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 10:13:03,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:13:03,496 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:13:03,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 10:13:03,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:13:03,703 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:13:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:13:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1907846367, now seen corresponding path program 4 times [2022-07-13 10:13:03,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:13:03,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988550313] [2022-07-13 10:13:03,704 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 10:13:03,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:13:03,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:13:03,705 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:13:03,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-13 10:13:03,756 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 10:13:03,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:13:03,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 10:13:03,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:13:03,828 INFO L390 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 16 treesize of output 12 [2022-07-13 10:13:03,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:13:03,906 INFO L390 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 29 treesize of output 28 [2022-07-13 10:13:03,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:13:03,968 INFO L390 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 23 treesize of output 22 [2022-07-13 10:13:04,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-07-13 10:13:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 10:13:04,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:13:05,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 34 [2022-07-13 10:13:05,089 INFO L390 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 974 treesize of output 958 [2022-07-13 10:13:05,304 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 10:13:05,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:13:05,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988550313] [2022-07-13 10:13:05,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988550313] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:13:05,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:13:05,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2022-07-13 10:13:05,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014274171] [2022-07-13 10:13:05,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:13:05,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 10:13:05,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:13:05,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 10:13:05,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-07-13 10:13:05,306 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:13:07,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 10:13:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:13:07,669 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-07-13 10:13:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 10:13:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-13 10:13:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:13:07,670 INFO L225 Difference]: With dead ends: 90 [2022-07-13 10:13:07,670 INFO L226 Difference]: Without dead ends: 80 [2022-07-13 10:13:07,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2022-07-13 10:13:07,671 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:13:07,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 193 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 209 Invalid, 1 Unknown, 61 Unchecked, 2.2s Time] [2022-07-13 10:13:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-13 10:13:07,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2022-07-13 10:13:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 75 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:13:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-13 10:13:07,678 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 43 [2022-07-13 10:13:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:13:07,678 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-13 10:13:07,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:13:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-13 10:13:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 10:13:07,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:13:07,679 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:13:07,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-13 10:13:07,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:13:07,883 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:13:07,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:13:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1514819357, now seen corresponding path program 5 times [2022-07-13 10:13:07,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:13:07,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324247371] [2022-07-13 10:13:07,884 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 10:13:07,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:13:07,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:13:07,885 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:13:07,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 10:13:07,951 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-13 10:13:07,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:13:07,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 10:13:07,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:13:08,127 INFO L390 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 19 treesize of output 15 [2022-07-13 10:13:08,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:13:08,235 INFO L390 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 23 treesize of output 22 [2022-07-13 10:13:08,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-07-13 10:13:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:13:08,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:13:08,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 31 [2022-07-13 10:13:08,942 INFO L390 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 114 treesize of output 110 [2022-07-13 10:13:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:13:09,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:13:09,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324247371] [2022-07-13 10:13:09,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324247371] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:13:09,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:13:09,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2022-07-13 10:13:09,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560251742] [2022-07-13 10:13:09,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:13:09,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-13 10:13:09,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:13:09,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-13 10:13:09,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-07-13 10:13:09,309 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:13:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:13:09,745 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2022-07-13 10:13:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 10:13:09,745 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-13 10:13:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:13:09,746 INFO L225 Difference]: With dead ends: 96 [2022-07-13 10:13:09,746 INFO L226 Difference]: Without dead ends: 86 [2022-07-13 10:13:09,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 10:13:09,747 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 43 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:13:09,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 209 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 0 Unknown, 144 Unchecked, 0.2s Time] [2022-07-13 10:13:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-13 10:13:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-07-13 10:13:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:13:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-07-13 10:13:09,754 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 43 [2022-07-13 10:13:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:13:09,754 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-07-13 10:13:09,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:13:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-07-13 10:13:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 10:13:09,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:13:09,755 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:13:09,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-13 10:13:09,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:13:09,961 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:13:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:13:09,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1347996176, now seen corresponding path program 6 times [2022-07-13 10:13:09,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:13:09,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998892873] [2022-07-13 10:13:09,962 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 10:13:09,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:13:09,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:13:09,963 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:13:09,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-13 10:13:10,061 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-13 10:13:10,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:13:10,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 10:13:10,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:13:10,143 INFO L390 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 13 treesize of output 9 [2022-07-13 10:13:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 10:13:10,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:13:10,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 18 [2022-07-13 10:13:10,508 INFO L390 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 36 treesize of output 32 [2022-07-13 10:13:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 10:13:10,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:13:10,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998892873] [2022-07-13 10:13:10,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998892873] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:13:10,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:13:10,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2022-07-13 10:13:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896832062] [2022-07-13 10:13:10,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:13:10,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 10:13:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:13:10,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 10:13:10,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-07-13 10:13:10,699 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 24 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 24 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:13:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:13:11,608 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2022-07-13 10:13:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-13 10:13:11,609 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 24 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-07-13 10:13:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:13:11,609 INFO L225 Difference]: With dead ends: 125 [2022-07-13 10:13:11,609 INFO L226 Difference]: Without dead ends: 123 [2022-07-13 10:13:11,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2022-07-13 10:13:11,610 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 122 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 10:13:11,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 332 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 10:13:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-13 10:13:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 80. [2022-07-13 10:13:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 79 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:13:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-07-13 10:13:11,617 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 49 [2022-07-13 10:13:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:13:11,617 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-07-13 10:13:11,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 24 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:13:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-07-13 10:13:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 10:13:11,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:13:11,618 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:13:11,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-13 10:13:11,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:13:11,818 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:13:11,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:13:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 82127225, now seen corresponding path program 4 times [2022-07-13 10:13:11,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:13:11,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043773509] [2022-07-13 10:13:11,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 10:13:11,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:13:11,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:13:11,820 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:13:11,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-13 10:13:11,879 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 10:13:11,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:13:11,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-13 10:13:11,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:13:11,927 INFO L390 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 19 treesize of output 15 [2022-07-13 10:13:11,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:13:11,999 INFO L390 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 29 treesize of output 28 [2022-07-13 10:13:12,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:13:12,107 INFO L390 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 32 treesize of output 31 [2022-07-13 10:13:12,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:13:12,167 INFO L390 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 29 treesize of output 28 [2022-07-13 10:13:12,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:13:12,242 INFO L390 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 32 treesize of output 31 [2022-07-13 10:13:12,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:13:12,292 INFO L390 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 29 treesize of output 28 [2022-07-13 10:13:12,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:13:12,388 INFO L390 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 32 treesize of output 31 [2022-07-13 10:13:12,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:13:12,437 INFO L390 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 21 treesize of output 20 [2022-07-13 10:13:12,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-07-13 10:13:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:13:12,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:13:17,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 78 treesize of output 76 [2022-07-13 10:13:35,566 INFO L390 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 925778053824492 treesize of output 925503175917548