./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s1lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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-fpi/s1lif.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 cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:29:53,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:29:53,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:29:53,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:29:53,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:29:53,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:29:53,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:29:53,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:29:53,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:29:53,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:29:53,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:29:53,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:29:53,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:29:53,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:29:53,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:29:53,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:29:53,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:29:53,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:29:53,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:29:53,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:29:53,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:29:53,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:29:53,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:29:53,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:29:53,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:29:53,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:29:53,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:29:53,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:29:53,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:29:53,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:29:53,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:29:53,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:29:53,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:29:53,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:29:53,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:29:53,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:29:53,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:29:53,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:29:53,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:29:53,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:29:53,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:29:53,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:29:53,481 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:29:53,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:29:53,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:29:53,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:29:53,483 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:29:53,483 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:29:53,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:29:53,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:29:53,484 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:29:53,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:29:53,485 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:29:53,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:29:53,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:29:53,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:29:53,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:29:53,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:29:53,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:29:53,486 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:29:53,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:29:53,486 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:29:53,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:29:53,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:29:53,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:29:53,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:29:53,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:29:53,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:29:53,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:29:53,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:29:53,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:29:53,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:29:53,489 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:29:53,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:29:53,489 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:29:53,489 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:29:53,489 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:29:53,490 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf [2023-02-16 00:29:53,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:29:53,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:29:53,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:29:53,767 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:29:53,768 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:29:53,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s1lif.c [2023-02-16 00:29:54,894 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:29:55,109 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:29:55,109 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1lif.c [2023-02-16 00:29:55,115 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e094c1758/2711ccf05a4f49d18a44e3df3dd6c0e3/FLAGbdbe29c10 [2023-02-16 00:29:55,136 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e094c1758/2711ccf05a4f49d18a44e3df3dd6c0e3 [2023-02-16 00:29:55,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:29:55,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:29:55,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:29:55,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:29:55,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:29:55,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8e5bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55, skipping insertion in model container [2023-02-16 00:29:55,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:29:55,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:29:55,301 WARN L237 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-fpi/s1lif.c[588,601] [2023-02-16 00:29:55,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:29:55,344 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:29:55,358 WARN L237 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-fpi/s1lif.c[588,601] [2023-02-16 00:29:55,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:29:55,387 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:29:55,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55 WrapperNode [2023-02-16 00:29:55,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:29:55,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:29:55,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:29:55,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:29:55,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,435 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2023-02-16 00:29:55,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:29:55,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:29:55,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:29:55,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:29:55,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,468 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:29:55,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:29:55,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:29:55,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:29:55,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55" (1/1) ... [2023-02-16 00:29:55,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:29:55,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:29:55,510 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) [2023-02-16 00:29:55,533 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 [2023-02-16 00:29:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:29:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:29:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:29:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:29:55,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 00:29:55,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:29:55,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:29:55,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:29:55,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:29:55,619 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:29:55,621 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:29:55,753 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:29:55,758 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:29:55,758 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 00:29:55,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:29:55 BoogieIcfgContainer [2023-02-16 00:29:55,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:29:55,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:29:55,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:29:55,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:29:55,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:29:55" (1/3) ... [2023-02-16 00:29:55,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5623ff2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:29:55, skipping insertion in model container [2023-02-16 00:29:55,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:55" (2/3) ... [2023-02-16 00:29:55,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5623ff2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:29:55, skipping insertion in model container [2023-02-16 00:29:55,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:29:55" (3/3) ... [2023-02-16 00:29:55,768 INFO L112 eAbstractionObserver]: Analyzing ICFG s1lif.c [2023-02-16 00:29:55,804 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:29:55,804 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:29:55,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:29:55,870 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@ddee2e0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:29:55,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:29:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) [2023-02-16 00:29:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 00:29:55,880 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:29:55,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:29:55,881 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:29:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:29:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2023-02-16 00:29:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:29:55,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805546279] [2023-02-16 00:29:55,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:29:55,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:29:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:29:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:29:56,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:29:56,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805546279] [2023-02-16 00:29:56,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805546279] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:29:56,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:29:56,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:29:56,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86496824] [2023-02-16 00:29:56,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:29:56,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:29:56,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:29:56,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:29:56,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:29:56,204 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) 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) [2023-02-16 00:29:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:29:56,217 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2023-02-16 00:29:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:29:56,219 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 [2023-02-16 00:29:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:29:56,225 INFO L225 Difference]: With dead ends: 40 [2023-02-16 00:29:56,225 INFO L226 Difference]: Without dead ends: 18 [2023-02-16 00:29:56,228 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 [2023-02-16 00:29:56,234 INFO L413 NwaCegarLoop]: 26 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, 26 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 [2023-02-16 00:29:56,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:29:56,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-16 00:29:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-16 00:29:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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) [2023-02-16 00:29:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-02-16 00:29:56,264 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2023-02-16 00:29:56,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:29:56,265 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-02-16 00:29:56,265 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) [2023-02-16 00:29:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-02-16 00:29:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 00:29:56,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:29:56,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:29:56,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:29:56,266 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:29:56,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:29:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2023-02-16 00:29:56,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:29:56,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906698091] [2023-02-16 00:29:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:29:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:29:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:29:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:29:56,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:29:56,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906698091] [2023-02-16 00:29:56,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906698091] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:29:56,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:29:56,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:29:56,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968578983] [2023-02-16 00:29:56,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:29:56,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:29:56,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:29:56,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:29:56,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:29:56,388 INFO L87 Difference]: Start difference. First operand 18 states and 21 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) [2023-02-16 00:29:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:29:56,441 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2023-02-16 00:29:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:29:56,442 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 [2023-02-16 00:29:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:29:56,443 INFO L225 Difference]: With dead ends: 36 [2023-02-16 00:29:56,443 INFO L226 Difference]: Without dead ends: 25 [2023-02-16 00:29:56,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:29:56,444 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:29:56,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:29:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-16 00:29:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2023-02-16 00:29:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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) [2023-02-16 00:29:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-02-16 00:29:56,451 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2023-02-16 00:29:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:29:56,451 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-02-16 00:29:56,451 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) [2023-02-16 00:29:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-02-16 00:29:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 00:29:56,452 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:29:56,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:29:56,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:29:56,457 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:29:56,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:29:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2023-02-16 00:29:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:29:56,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463892101] [2023-02-16 00:29:56,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:29:56,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:29:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:29:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:29:57,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:29:57,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463892101] [2023-02-16 00:29:57,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463892101] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:29:57,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311599744] [2023-02-16 00:29:57,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:29:57,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:29:57,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:29:57,559 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) [2023-02-16 00:29:57,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 00:29:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:29:57,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-16 00:29:57,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:29:57,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:29:57,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 00:29:57,837 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-16 00:29:58,017 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-02-16 00:29:58,124 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 36 treesize of output 23 [2023-02-16 00:29:58,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-02-16 00:29:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:29:58,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:29:58,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:29:58,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 44 [2023-02-16 00:29:58,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:29:58,650 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2023-02-16 00:29:58,653 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:29:58,655 INFO L350 Elim1Store]: Elim1 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 46 treesize of output 34 [2023-02-16 00:29:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:29:58,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311599744] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:29:58,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:29:58,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 32 [2023-02-16 00:29:58,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397957064] [2023-02-16 00:29:58,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:29:58,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-16 00:29:58,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:29:58,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-16 00:29:58,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2023-02-16 00:29:58,694 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 states have internal predecessors, (51), 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) [2023-02-16 00:29:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:29:59,974 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2023-02-16 00:29:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 00:29:59,975 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 states have internal predecessors, (51), 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 20 [2023-02-16 00:29:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:29:59,977 INFO L225 Difference]: With dead ends: 53 [2023-02-16 00:29:59,978 INFO L226 Difference]: Without dead ends: 49 [2023-02-16 00:29:59,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=534, Invalid=1916, Unknown=0, NotChecked=0, Total=2450 [2023-02-16 00:29:59,980 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 95 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:29:59,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 77 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:29:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-16 00:29:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2023-02-16 00:29:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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) [2023-02-16 00:29:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-02-16 00:29:59,989 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2023-02-16 00:29:59,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:29:59,989 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-02-16 00:29:59,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 states have internal predecessors, (51), 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) [2023-02-16 00:29:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-02-16 00:29:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 00:29:59,990 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:29:59,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:30:00,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 00:30:00,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:30:00,197 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:30:00,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:30:00,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2023-02-16 00:30:00,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:30:00,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197549889] [2023-02-16 00:30:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:30:00,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:30:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:30:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:30:00,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:30:00,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197549889] [2023-02-16 00:30:00,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197549889] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:30:00,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24237255] [2023-02-16 00:30:00,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:30:00,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:30:00,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:30:00,381 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) [2023-02-16 00:30:00,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 00:30:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:30:00,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 00:30:00,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:30:00,449 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-16 00:30:00,468 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:30:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:30:00,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:30:00,506 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2023-02-16 00:30:00,508 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 16 [2023-02-16 00:30:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:30:00,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24237255] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:30:00,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:30:00,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-02-16 00:30:00,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336804583] [2023-02-16 00:30:00,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:30:00,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 00:30:00,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:30:00,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 00:30:00,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-16 00:30:00,521 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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) [2023-02-16 00:30:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:30:00,589 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2023-02-16 00:30:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 00:30:00,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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) Word has length 20 [2023-02-16 00:30:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:30:00,591 INFO L225 Difference]: With dead ends: 48 [2023-02-16 00:30:00,591 INFO L226 Difference]: Without dead ends: 37 [2023-02-16 00:30:00,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:30:00,592 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:30:00,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 50 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:30:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-16 00:30:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2023-02-16 00:30:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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) [2023-02-16 00:30:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-02-16 00:30:00,599 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2023-02-16 00:30:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:30:00,599 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-02-16 00:30:00,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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) [2023-02-16 00:30:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-02-16 00:30:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 00:30:00,600 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:30:00,600 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] [2023-02-16 00:30:00,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 00:30:00,805 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,SelfDestructingSolverStorable3 [2023-02-16 00:30:00,806 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:30:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:30:00,806 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2023-02-16 00:30:00,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:30:00,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636753840] [2023-02-16 00:30:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:30:00,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:30:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:30:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:30:00,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:30:00,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636753840] [2023-02-16 00:30:00,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636753840] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:30:00,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185059778] [2023-02-16 00:30:00,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:30:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:30:00,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:30:00,880 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) [2023-02-16 00:30:00,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 00:30:00,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:30:00,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:30:00,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:30:00,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:30:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:30:00,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:30:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:30:01,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185059778] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:30:01,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:30:01,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-16 00:30:01,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737628114] [2023-02-16 00:30:01,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:30:01,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:30:01,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:30:01,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:30:01,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:30:01,035 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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) [2023-02-16 00:30:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:30:01,121 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2023-02-16 00:30:01,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:30:01,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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 [2023-02-16 00:30:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:30:01,123 INFO L225 Difference]: With dead ends: 70 [2023-02-16 00:30:01,123 INFO L226 Difference]: Without dead ends: 44 [2023-02-16 00:30:01,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-16 00:30:01,124 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:30:01,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 29 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:30:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-16 00:30:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2023-02-16 00:30:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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) [2023-02-16 00:30:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-02-16 00:30:01,131 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2023-02-16 00:30:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:30:01,131 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-02-16 00:30:01,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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) [2023-02-16 00:30:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-02-16 00:30:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 00:30:01,132 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:30:01,132 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] [2023-02-16 00:30:01,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 00:30:01,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:30:01,344 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:30:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:30:01,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2023-02-16 00:30:01,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:30:01,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385687563] [2023-02-16 00:30:01,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:30:01,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:30:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:30:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:30:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:30:01,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385687563] [2023-02-16 00:30:01,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385687563] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:30:01,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960376611] [2023-02-16 00:30:01,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:30:01,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:30:01,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:30:01,465 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) [2023-02-16 00:30:01,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 00:30:01,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 00:30:01,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:30:01,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:30:01,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:30:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:30:01,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:30:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:30:01,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960376611] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:30:01,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:30:01,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-16 00:30:01,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009210774] [2023-02-16 00:30:01,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:30:01,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:30:01,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:30:01,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:30:01,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:30:01,613 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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) [2023-02-16 00:30:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:30:01,711 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-02-16 00:30:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:30:01,711 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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 [2023-02-16 00:30:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:30:01,711 INFO L225 Difference]: With dead ends: 39 [2023-02-16 00:30:01,712 INFO L226 Difference]: Without dead ends: 31 [2023-02-16 00:30:01,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-16 00:30:01,713 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:30:01,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 27 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:30:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-16 00:30:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-02-16 00:30:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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) [2023-02-16 00:30:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-02-16 00:30:01,719 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2023-02-16 00:30:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:30:01,719 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-16 00:30:01,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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) [2023-02-16 00:30:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-02-16 00:30:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 00:30:01,721 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:30:01,721 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:30:01,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 00:30:01,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:30:01,927 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:30:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:30:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2023-02-16 00:30:01,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:30:01,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008020951] [2023-02-16 00:30:01,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:30:01,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:30:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:30:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:30:03,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:30:03,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008020951] [2023-02-16 00:30:03,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008020951] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:30:03,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162052852] [2023-02-16 00:30:03,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:30:03,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:30:03,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:30:03,213 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) [2023-02-16 00:30:03,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 00:30:03,278 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:30:03,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:30:03,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-16 00:30:03,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:30:03,315 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-16 00:30:03,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:30:03,364 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-16 00:30:03,402 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-16 00:30:03,547 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-16 00:30:03,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:30:03,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2023-02-16 00:30:03,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:30:03,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:30:03,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2023-02-16 00:30:03,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2023-02-16 00:30:04,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 34 [2023-02-16 00:30:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:30:04,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:30:05,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:30:05,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 264 treesize of output 124 [2023-02-16 00:30:13,020 WARN L233 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:30:20,560 WARN L233 SmtUtils]: Spent 7.36s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:30:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:30:20,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162052852] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:30:20,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:30:20,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 49 [2023-02-16 00:30:20,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912106293] [2023-02-16 00:30:20,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:30:20,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-16 00:30:20,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:30:20,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-16 00:30:20,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1997, Unknown=0, NotChecked=0, Total=2352 [2023-02-16 00:30:20,651 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 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) [2023-02-16 00:30:38,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:30:41,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:30:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:30:59,119 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2023-02-16 00:30:59,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-02-16 00:30:59,119 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 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 27 [2023-02-16 00:30:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:30:59,120 INFO L225 Difference]: With dead ends: 101 [2023-02-16 00:30:59,120 INFO L226 Difference]: Without dead ends: 87 [2023-02-16 00:30:59,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 48.3s TimeCoverageRelationStatistics Valid=1307, Invalid=7065, Unknown=0, NotChecked=0, Total=8372 [2023-02-16 00:30:59,123 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 107 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 217 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:30:59,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 103 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 755 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2023-02-16 00:30:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-16 00:30:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 55. [2023-02-16 00:30:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 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) [2023-02-16 00:30:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2023-02-16 00:30:59,136 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 27 [2023-02-16 00:30:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:30:59,136 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2023-02-16 00:30:59,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 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) [2023-02-16 00:30:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2023-02-16 00:30:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 00:30:59,137 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:30:59,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:30:59,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 00:30:59,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:30:59,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:30:59,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:30:59,339 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2023-02-16 00:30:59,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:30:59,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931844930] [2023-02-16 00:30:59,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:30:59,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:30:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:30:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:30:59,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:30:59,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931844930] [2023-02-16 00:30:59,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931844930] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:30:59,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708095178] [2023-02-16 00:30:59,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:30:59,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:30:59,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:30:59,937 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:30:59,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 00:30:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:30:59,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 00:31:00,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:31:00,048 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2023-02-16 00:31:00,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:00,134 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:31:00,176 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 00:31:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:31:00,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:31:00,332 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 14 [2023-02-16 00:31:00,338 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 16 [2023-02-16 00:31:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:31:00,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708095178] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:31:00,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:31:00,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-02-16 00:31:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029639937] [2023-02-16 00:31:00,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:31:00,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:31:00,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:31:00,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:31:00,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:31:00,403 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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) [2023-02-16 00:31:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:31:00,761 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2023-02-16 00:31:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 00:31:00,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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 27 [2023-02-16 00:31:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:31:00,762 INFO L225 Difference]: With dead ends: 79 [2023-02-16 00:31:00,762 INFO L226 Difference]: Without dead ends: 55 [2023-02-16 00:31:00,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:31:00,763 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:31:00,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 66 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:31:00,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-16 00:31:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2023-02-16 00:31:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 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) [2023-02-16 00:31:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2023-02-16 00:31:00,782 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 27 [2023-02-16 00:31:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:31:00,784 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2023-02-16 00:31:00,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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) [2023-02-16 00:31:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2023-02-16 00:31:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:31:00,787 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:31:00,787 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:31:00,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 00:31:00,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:31:00,992 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:31:00,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:31:00,993 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2023-02-16 00:31:00,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:31:00,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172805532] [2023-02-16 00:31:00,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:31:00,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:31:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:31:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:31:01,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:31:01,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172805532] [2023-02-16 00:31:01,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172805532] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:31:01,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724384042] [2023-02-16 00:31:01,173 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 00:31:01,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:31:01,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:31:01,189 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:31:01,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 00:31:01,263 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-16 00:31:01,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:31:01,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 00:31:01,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:31:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:31:01,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:31:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:31:01,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724384042] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:31:01,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:31:01,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-16 00:31:01,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105286810] [2023-02-16 00:31:01,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:31:01,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:31:01,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:31:01,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:31:01,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:31:01,577 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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) [2023-02-16 00:31:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:31:01,860 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2023-02-16 00:31:01,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 00:31:01,861 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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 29 [2023-02-16 00:31:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:31:01,861 INFO L225 Difference]: With dead ends: 91 [2023-02-16 00:31:01,862 INFO L226 Difference]: Without dead ends: 53 [2023-02-16 00:31:01,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:31:01,863 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:31:01,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 31 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:31:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-16 00:31:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2023-02-16 00:31:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 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) [2023-02-16 00:31:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-02-16 00:31:01,873 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2023-02-16 00:31:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:31:01,873 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-02-16 00:31:01,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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) [2023-02-16 00:31:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-02-16 00:31:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:31:01,874 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:31:01,874 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:31:01,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 00:31:02,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:31:02,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:31:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:31:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2023-02-16 00:31:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:31:02,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027835201] [2023-02-16 00:31:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:31:02,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:31:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:31:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:31:02,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:31:02,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027835201] [2023-02-16 00:31:02,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027835201] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:31:02,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977488919] [2023-02-16 00:31:02,246 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-16 00:31:02,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:31:02,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:31:02,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:31:02,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 00:31:02,330 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-16 00:31:02,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:31:02,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 00:31:02,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:31:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:31:02,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:31:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:31:02,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977488919] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:31:02,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:31:02,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-16 00:31:02,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89964595] [2023-02-16 00:31:02,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:31:02,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:31:02,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:31:02,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:31:02,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:31:02,605 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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) [2023-02-16 00:31:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:31:02,902 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2023-02-16 00:31:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 00:31:02,903 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 29 [2023-02-16 00:31:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:31:02,903 INFO L225 Difference]: With dead ends: 48 [2023-02-16 00:31:02,903 INFO L226 Difference]: Without dead ends: 38 [2023-02-16 00:31:02,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-02-16 00:31:02,904 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:31:02,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:31:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-16 00:31:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2023-02-16 00:31:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 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) [2023-02-16 00:31:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-02-16 00:31:02,916 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2023-02-16 00:31:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:31:02,917 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-02-16 00:31:02,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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) [2023-02-16 00:31:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2023-02-16 00:31:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 00:31:02,920 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:31:02,920 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:31:02,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 00:31:03,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-16 00:31:03,122 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:31:03,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:31:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2023-02-16 00:31:03,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:31:03,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754714668] [2023-02-16 00:31:03,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:31:03,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:31:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:31:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:31:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:31:06,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754714668] [2023-02-16 00:31:06,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754714668] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:31:06,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505968275] [2023-02-16 00:31:06,440 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-16 00:31:06,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:31:06,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:31:06,442 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:31:06,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 00:31:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:31:06,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 83 conjunts are in the unsatisfiable core [2023-02-16 00:31:06,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:31:06,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:31:06,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 00:31:06,823 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-16 00:31:07,019 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-16 00:31:07,223 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-16 00:31:07,718 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-16 00:31:08,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:08,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2023-02-16 00:31:08,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:08,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:08,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2023-02-16 00:31:08,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:08,746 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:31:08,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:08,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-02-16 00:31:09,024 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:31:09,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:09,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:09,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2023-02-16 00:31:09,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-02-16 00:31:09,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 35 [2023-02-16 00:31:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:31:09,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:31:15,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:31:15,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 836 treesize of output 258 [2023-02-16 00:31:15,474 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (let ((.cse6 (* 2 c_~N~0)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 2 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= 2 (select v_arrayElimArr_4 .cse1))) (<= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 2))))) .cse6))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 2 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= 2 (select v_arrayElimArr_4 .cse1))) (<= .cse6 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 2))))))))))) is different from false [2023-02-16 00:31:15,543 WARN L837 $PredicateComparison]: unable to prove that (or (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) c_~N~0) (let ((.cse6 (* 2 c_~N~0)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 2 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= 2 (select v_arrayElimArr_4 .cse1))) (<= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 2))))) .cse6))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 2 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= 2 (select v_arrayElimArr_4 .cse1))) (<= .cse6 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 2))))))))))) is different from false [2023-02-16 00:31:15,696 WARN L837 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) c_~N~0) (let ((.cse6 (* 2 c_~N~0)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 2 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= 2 (select v_arrayElimArr_4 .cse1))) (<= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 2))))) .cse6))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 2 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= 2 (select v_arrayElimArr_4 .cse1))) (<= .cse6 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 2)))))))))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) c_~N~0))) is different from false [2023-02-16 00:31:15,795 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 00:31:15,795 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2023-02-16 00:31:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-02-16 00:31:15,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505968275] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:31:15,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:31:15,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 24] total 69 [2023-02-16 00:31:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625654037] [2023-02-16 00:31:15,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:31:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-02-16 00:31:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:31:15,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-02-16 00:31:15,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=3825, Unknown=3, NotChecked=390, Total=4692 [2023-02-16 00:31:15,801 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 69 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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) [2023-02-16 00:31:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:31:39,532 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2023-02-16 00:31:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-16 00:31:39,533 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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 [2023-02-16 00:31:39,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:31:39,534 INFO L225 Difference]: With dead ends: 79 [2023-02-16 00:31:39,534 INFO L226 Difference]: Without dead ends: 75 [2023-02-16 00:31:39,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2945 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=1234, Invalid=9077, Unknown=3, NotChecked=606, Total=10920 [2023-02-16 00:31:39,537 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 104 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:31:39,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 148 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1234 Invalid, 0 Unknown, 152 Unchecked, 4.0s Time] [2023-02-16 00:31:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-16 00:31:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2023-02-16 00:31:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 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) [2023-02-16 00:31:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2023-02-16 00:31:39,550 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2023-02-16 00:31:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:31:39,551 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2023-02-16 00:31:39,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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) [2023-02-16 00:31:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2023-02-16 00:31:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 00:31:39,553 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:31:39,553 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:31:39,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 00:31:39,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:31:39,757 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:31:39,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:31:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2023-02-16 00:31:39,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:31:39,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545631147] [2023-02-16 00:31:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:31:39,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:31:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:31:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 00:31:40,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:31:40,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545631147] [2023-02-16 00:31:40,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545631147] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:31:40,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964537902] [2023-02-16 00:31:40,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:31:40,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:31:40,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:31:40,261 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:31:40,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-16 00:31:40,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:31:40,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:31:40,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-16 00:31:40,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:31:40,512 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:31:40,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:40,669 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 24 [2023-02-16 00:31:40,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:40,767 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 24 [2023-02-16 00:31:40,838 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:31:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 00:31:40,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:31:40,936 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 14 [2023-02-16 00:31:40,940 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 16 [2023-02-16 00:31:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 00:31:40,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964537902] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:31:40,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:31:40,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2023-02-16 00:31:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441624725] [2023-02-16 00:31:40,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:31:40,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 00:31:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:31:40,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 00:31:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2023-02-16 00:31:40,994 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 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) [2023-02-16 00:31:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:31:41,503 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2023-02-16 00:31:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 00:31:41,504 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 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 [2023-02-16 00:31:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:31:41,505 INFO L225 Difference]: With dead ends: 76 [2023-02-16 00:31:41,505 INFO L226 Difference]: Without dead ends: 61 [2023-02-16 00:31:41,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2023-02-16 00:31:41,506 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 00:31:41,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 82 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 00:31:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-16 00:31:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2023-02-16 00:31:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 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) [2023-02-16 00:31:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-02-16 00:31:41,518 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 34 [2023-02-16 00:31:41,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:31:41,518 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-02-16 00:31:41,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 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) [2023-02-16 00:31:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-02-16 00:31:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 00:31:41,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:31:41,519 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:31:41,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-16 00:31:41,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-16 00:31:41,721 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:31:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:31:41,721 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2023-02-16 00:31:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:31:41,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071718389] [2023-02-16 00:31:41,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:31:41,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:31:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:31:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 00:31:41,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:31:41,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071718389] [2023-02-16 00:31:41,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071718389] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:31:41,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721576114] [2023-02-16 00:31:41,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:31:41,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:31:41,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:31:41,949 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:31:41,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-16 00:31:42,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:31:42,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:31:42,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 00:31:42,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:31:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 00:31:42,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:31:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 00:31:42,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721576114] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:31:42,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:31:42,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-16 00:31:42,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096453093] [2023-02-16 00:31:42,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:31:42,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 00:31:42,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:31:42,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 00:31:42,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:31:42,442 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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) [2023-02-16 00:31:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:31:42,823 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2023-02-16 00:31:42,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 00:31:42,823 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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 36 [2023-02-16 00:31:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:31:42,824 INFO L225 Difference]: With dead ends: 102 [2023-02-16 00:31:42,824 INFO L226 Difference]: Without dead ends: 62 [2023-02-16 00:31:42,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2023-02-16 00:31:42,825 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 103 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:31:42,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 33 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:31:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-16 00:31:42,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2023-02-16 00:31:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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) [2023-02-16 00:31:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-02-16 00:31:42,838 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2023-02-16 00:31:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:31:42,838 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-02-16 00:31:42,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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) [2023-02-16 00:31:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-02-16 00:31:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 00:31:42,839 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:31:42,839 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:31:42,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-16 00:31:43,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-16 00:31:43,046 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:31:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:31:43,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 9 times [2023-02-16 00:31:43,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:31:43,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642193636] [2023-02-16 00:31:43,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:31:43,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:31:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:31:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 00:31:43,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:31:43,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642193636] [2023-02-16 00:31:43,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642193636] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:31:43,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655515641] [2023-02-16 00:31:43,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:31:43,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:31:43,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:31:43,297 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:31:43,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-16 00:31:43,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-16 00:31:43,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:31:43,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 00:31:43,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:31:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 00:31:43,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:31:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 00:31:43,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655515641] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:31:43,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:31:43,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-16 00:31:43,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032020116] [2023-02-16 00:31:43,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:31:43,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 00:31:43,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:31:43,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 00:31:43,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:31:43,875 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 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) [2023-02-16 00:31:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:31:44,412 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2023-02-16 00:31:44,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 00:31:44,412 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 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 36 [2023-02-16 00:31:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:31:44,413 INFO L225 Difference]: With dead ends: 57 [2023-02-16 00:31:44,413 INFO L226 Difference]: Without dead ends: 45 [2023-02-16 00:31:44,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-02-16 00:31:44,414 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 75 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:31:44,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 24 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:31:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-16 00:31:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-02-16 00:31:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 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) [2023-02-16 00:31:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2023-02-16 00:31:44,427 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 36 [2023-02-16 00:31:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:31:44,427 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2023-02-16 00:31:44,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 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) [2023-02-16 00:31:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2023-02-16 00:31:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 00:31:44,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:31:44,432 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:31:44,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-16 00:31:44,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-16 00:31:44,638 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:31:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:31:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2023-02-16 00:31:44,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:31:44,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356760484] [2023-02-16 00:31:44,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:31:44,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:31:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:31:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:31:50,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:31:50,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356760484] [2023-02-16 00:31:50,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356760484] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:31:50,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716802042] [2023-02-16 00:31:50,004 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:31:50,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:31:50,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:31:50,005 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:31:50,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-16 00:31:50,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:31:50,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:31:50,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 97 conjunts are in the unsatisfiable core [2023-02-16 00:31:50,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:31:50,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:31:50,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 00:31:50,142 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-16 00:31:50,191 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-16 00:31:50,265 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-16 00:31:50,333 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-16 00:31:50,731 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-16 00:31:51,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2023-02-16 00:31:51,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2023-02-16 00:31:52,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:52,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:52,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:52,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2023-02-16 00:31:52,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:52,768 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:31:52,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:52,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:52,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2023-02-16 00:31:53,176 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:31:53,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:53,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:53,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:53,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:53,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2023-02-16 00:31:53,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:53,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:53,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:53,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:53,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:53,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:31:53,552 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:31:53,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2023-02-16 00:31:53,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2023-02-16 00:31:54,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 39 [2023-02-16 00:31:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:31:54,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:09,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:32:09,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 2288 treesize of output 520 [2023-02-16 00:32:12,612 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (< .cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse6 1))))))) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse8) 2)) (not (= (select v_arrayElimArr_6 .cse7) 2)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse8) 2)) (not (= (select v_arrayElimArr_6 .cse7) 2)) (< (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse9 .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse13)))))) (+ .cse1 1)))))) is different from false [2023-02-16 00:32:14,904 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (select v_arrayElimArr_6 .cse2) 2)) (< (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse7)))))) (+ .cse8 3)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (select v_arrayElimArr_6 .cse2) 2)) (< (+ .cse8 1) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse9 .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse13))))))))))) is different from false [2023-02-16 00:32:17,792 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (select v_arrayElimArr_6 .cse2) 2)) (< (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse7)))))) (+ .cse8 3)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (select v_arrayElimArr_6 .cse2) 2)) (< (+ .cse8 1) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse9 .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse13))))))))))) is different from false [2023-02-16 00:32:20,828 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (< (+ .cse1 3) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse6))))))) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse8) 2)) (not (= (select v_arrayElimArr_6 .cse7) 2)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse8) 2)) (not (= (select v_arrayElimArr_6 .cse7) 2)) (< (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse9 .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse13)))))) (+ .cse1 5)))))) is different from false [2023-02-16 00:32:24,349 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (select v_arrayElimArr_6 .cse2) 2)) (< (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse7)))))) (+ .cse8 7)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (select v_arrayElimArr_6 .cse2) 2)) (< (+ .cse8 5) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse9 .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse13))))))))))) is different from false [2023-02-16 00:32:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-02-16 00:32:24,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716802042] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:24,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:32:24,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 31] total 80 [2023-02-16 00:32:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000318370] [2023-02-16 00:32:24,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:24,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-02-16 00:32:24,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:24,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-02-16 00:32:24,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=5036, Unknown=5, NotChecked=750, Total=6320 [2023-02-16 00:32:24,587 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 80 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 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) [2023-02-16 00:32:29,351 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse15 (* 2 c_~N~0)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (select v_arrayElimArr_6 .cse2) 2)) (< (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse7)))))) (+ .cse8 7)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (select v_arrayElimArr_6 .cse2) 2)) (< (+ .cse8 5) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse9 .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse13))))))))) (or (<= (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 |c_ULTIMATE.start_main_~i~0#1|) 1) (* 4 c_~N~0)) (let ((.cse14 (+ (select .cse17 0) (select .cse17 12) (select .cse17 4) (select .cse17 8)))) (and (<= .cse14 .cse15) (<= .cse15 .cse14) .cse16))) (let ((.cse19 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (select .cse17 .cse1)) (.cse21 (select .cse17 .cse0)) (.cse20 (select .cse17 .cse2))) (or (not (= 1 .cse18)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (not (= 1 .cse19)) (not (= 1 .cse20)) (not (= 1 .cse21)) (let ((.cse22 (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse19 1)) .cse1 (+ .cse18 1)) .cse0 (+ .cse21 1)) .cse2 (+ .cse20 1))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse23 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse27 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse19 .cse27 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse23 .cse24 .cse19 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse19 .cse27 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse27 1)))))))) (and (<= .cse22 .cse15) (<= .cse15 .cse22))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) .cse16)) is different from false [2023-02-16 00:32:33,811 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* 2 c_~N~0)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse11 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (and (<= |c_ULTIMATE.start_main_~i~0#1| 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (< (+ .cse1 3) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse6))))))) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse8) 2)) (not (= (select v_arrayElimArr_6 .cse7) 2)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (or (<= (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 |c_ULTIMATE.start_main_~i~0#1|) 1) (* 4 c_~N~0)) (let ((.cse9 (+ (select .cse12 0) (select .cse12 12) (select .cse12 4) (select .cse12 8)))) (and (<= .cse9 .cse10) (<= .cse10 .cse9) .cse11))) (let ((.cse14 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (select .cse12 .cse8)) (.cse16 (select .cse12 .cse0)) (.cse15 (select .cse12 .cse7))) (or (not (= 1 .cse13)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (not (= 1 .cse14)) (not (= 1 .cse15)) (not (= 1 .cse16)) (let ((.cse17 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse14 1)) .cse8 (+ .cse13 1)) .cse0 (+ .cse16 1)) .cse7 (+ .cse15 1))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse22 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse14 .cse22 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse18 .cse19 .cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse14 .cse22 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse22 1)))))))) (and (<= .cse17 .cse10) (<= .cse10 .cse17))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse8) 2)) (not (= (select v_arrayElimArr_6 .cse7) 2)) (< (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse23 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse27 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse23 .cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse27 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse27)))))) (+ .cse1 5)))) .cse11)) is different from false [2023-02-16 00:32:38,407 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse15 (* 2 c_~N~0)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (select v_arrayElimArr_6 .cse2) 2)) (< (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse7 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse7)))))) (+ .cse8 3)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (select v_arrayElimArr_6 .cse2) 2)) (< (+ .cse8 1) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse9 .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse13))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (or (<= (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 |c_ULTIMATE.start_main_~i~0#1|) 1) (* 4 c_~N~0)) (let ((.cse14 (+ (select .cse17 0) (select .cse17 12) (select .cse17 4) (select .cse17 8)))) (and (<= .cse14 .cse15) (<= .cse15 .cse14) .cse16))) (let ((.cse19 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (select .cse17 .cse1)) (.cse21 (select .cse17 .cse0)) (.cse20 (select .cse17 .cse2))) (or (not (= 1 .cse18)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (not (= 1 .cse19)) (not (= 1 .cse20)) (not (= 1 .cse21)) (let ((.cse22 (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse19 1)) .cse1 (+ .cse18 1)) .cse0 (+ .cse21 1)) .cse2 (+ .cse20 1))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse23 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse27 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse19 .cse27 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse23 .cse24 .cse19 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse19 .cse27 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse27 1)))))))) (and (<= .cse22 .cse15) (<= .cse15 .cse22))))) .cse16)) is different from false [2023-02-16 00:33:21,214 WARN L233 SmtUtils]: Spent 26.64s on a formula simplification. DAG size of input: 168 DAG size of output: 168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:33:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:33:44,589 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2023-02-16 00:33:44,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-16 00:33:44,591 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 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 41 [2023-02-16 00:33:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:33:44,592 INFO L225 Difference]: With dead ends: 94 [2023-02-16 00:33:44,592 INFO L226 Difference]: Without dead ends: 90 [2023-02-16 00:33:44,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 93 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 99.6s TimeCoverageRelationStatistics Valid=779, Invalid=6727, Unknown=8, NotChecked=1416, Total=8930 [2023-02-16 00:33:44,594 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 52 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 2078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:33:44,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 251 Invalid, 2078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1686 Invalid, 0 Unknown, 302 Unchecked, 13.1s Time] [2023-02-16 00:33:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-16 00:33:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2023-02-16 00:33:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 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) [2023-02-16 00:33:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2023-02-16 00:33:44,614 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 41 [2023-02-16 00:33:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:33:44,615 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-02-16 00:33:44,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 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) [2023-02-16 00:33:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2023-02-16 00:33:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 00:33:44,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:33:44,616 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:33:44,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-16 00:33:44,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-16 00:33:44,823 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:33:44,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:33:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash 97262195, now seen corresponding path program 3 times [2023-02-16 00:33:44,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:33:44,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334378017] [2023-02-16 00:33:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:33:44,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:33:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:33:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 00:33:47,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:33:47,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334378017] [2023-02-16 00:33:47,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334378017] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:33:47,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814254673] [2023-02-16 00:33:47,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:33:47,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:33:47,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:33:47,432 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:33:47,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-16 00:33:47,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-16 00:33:47,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:33:47,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-16 00:33:47,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:33:47,665 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2023-02-16 00:33:54,395 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-02-16 00:33:54,396 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 34 [2023-02-16 00:33:54,984 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 00:33:54,985 INFO L350 Elim1Store]: Elim1 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 47 [2023-02-16 00:33:55,478 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-02-16 00:33:55,480 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 58 [2023-02-16 00:33:56,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:33:56,253 INFO L350 Elim1Store]: Elim1 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 46 treesize of output 46 [2023-02-16 00:33:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 00:33:58,351 INFO L328 TraceCheckSpWp]: Computing backward predicates...