./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s3if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 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/s3if.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 e1607ef1a0546f5061a453264a19ed217d8c8fc9b28320eac9d61d4efa33b72e --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:10:47,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:10:47,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:10:47,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:10:47,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:10:47,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:10:47,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:10:47,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:10:47,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:10:47,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:10:47,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:10:47,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:10:47,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:10:47,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:10:47,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:10:47,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:10:47,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:10:47,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:10:47,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:10:47,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:10:47,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:10:47,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:10:47,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:10:47,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:10:47,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:10:47,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:10:47,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:10:47,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:10:47,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:10:47,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:10:47,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:10:47,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:10:47,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:10:47,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:10:47,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:10:47,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:10:47,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:10:47,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:10:47,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:10:47,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:10:47,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:10:47,466 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:10:47,487 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:10:47,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:10:47,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:10:47,488 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:10:47,488 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:10:47,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:10:47,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:10:47,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:10:47,489 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:10:47,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:10:47,490 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:10:47,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:10:47,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:10:47,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:10:47,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:10:47,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:10:47,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:10:47,491 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:10:47,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:10:47,491 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:10:47,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:10:47,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:10:47,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:10:47,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:10:47,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:10:47,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:10:47,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:10:47,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:10:47,493 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:10:47,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:10:47,493 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:10:47,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:10:47,493 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:10:47,493 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:10:47,493 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:10:47,494 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 -> e1607ef1a0546f5061a453264a19ed217d8c8fc9b28320eac9d61d4efa33b72e [2023-02-15 19:10:47,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:10:47,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:10:47,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:10:47,673 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:10:47,673 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:10:47,674 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s3if.c [2023-02-15 19:10:48,525 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:10:48,693 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:10:48,694 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s3if.c [2023-02-15 19:10:48,697 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec5c5c11/9bba9894099e4df4a75a45812e654f6a/FLAG553d0daa5 [2023-02-15 19:10:48,707 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec5c5c11/9bba9894099e4df4a75a45812e654f6a [2023-02-15 19:10:48,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:10:48,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:10:48,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:10:48,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:10:48,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:10:48,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53009d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48, skipping insertion in model container [2023-02-15 19:10:48,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:10:48,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:10:48,812 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/s3if.c[587,600] [2023-02-15 19:10:48,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:10:48,833 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:10:48,845 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/s3if.c[587,600] [2023-02-15 19:10:48,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:10:48,861 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:10:48,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48 WrapperNode [2023-02-15 19:10:48,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:10:48,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:10:48,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:10:48,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:10:48,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,887 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2023-02-15 19:10:48,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:10:48,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:10:48,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:10:48,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:10:48,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:10:48,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:10:48,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:10:48,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:10:48,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48" (1/1) ... [2023-02-15 19:10:48,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:10:48,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:10:48,930 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-15 19:10:48,935 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-15 19:10:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:10:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:10:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 19:10:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:10:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:10:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:10:48,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:10:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:10:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:10:49,007 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:10:49,008 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:10:49,103 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:10:49,107 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:10:49,107 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 19:10:49,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:10:49 BoogieIcfgContainer [2023-02-15 19:10:49,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:10:49,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:10:49,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:10:49,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:10:49,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:10:48" (1/3) ... [2023-02-15 19:10:49,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6c9fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:10:49, skipping insertion in model container [2023-02-15 19:10:49,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:10:48" (2/3) ... [2023-02-15 19:10:49,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6c9fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:10:49, skipping insertion in model container [2023-02-15 19:10:49,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:10:49" (3/3) ... [2023-02-15 19:10:49,114 INFO L112 eAbstractionObserver]: Analyzing ICFG s3if.c [2023-02-15 19:10:49,126 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:10:49,128 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:10:49,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:10:49,175 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;@3a12f588, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:10:49,175 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:10:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:10:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 19:10:49,182 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:10:49,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:10:49,183 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:10:49,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:10:49,186 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2023-02-15 19:10:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:10:49,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872229676] [2023-02-15 19:10:49,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:49,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:10:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:49,291 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-15 19:10:49,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:10:49,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872229676] [2023-02-15 19:10:49,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872229676] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:10:49,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:10:49,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:10:49,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946701215] [2023-02-15 19:10:49,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:10:49,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:10:49,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:10:49,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:10:49,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:10:49,322 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-15 19:10:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:10:49,332 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2023-02-15 19:10:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:10:49,333 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2023-02-15 19:10:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:10:49,337 INFO L225 Difference]: With dead ends: 34 [2023-02-15 19:10:49,338 INFO L226 Difference]: Without dead ends: 15 [2023-02-15 19:10:49,339 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-15 19:10:49,342 INFO L413 NwaCegarLoop]: 22 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, 22 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-15 19:10:49,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:10:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-02-15 19:10:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-02-15 19:10:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-15 19:10:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-02-15 19:10:49,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2023-02-15 19:10:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:10:49,361 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-02-15 19:10:49,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-15 19:10:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-02-15 19:10:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 19:10:49,362 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:10:49,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:10:49,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:10:49,363 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:10:49,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:10:49,363 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2023-02-15 19:10:49,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:10:49,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12462186] [2023-02-15 19:10:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:49,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:10:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:49,529 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-15 19:10:49,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:10:49,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12462186] [2023-02-15 19:10:49,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12462186] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:10:49,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:10:49,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:10:49,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911779568] [2023-02-15 19:10:49,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:10:49,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:10:49,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:10:49,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:10:49,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:10:49,535 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-15 19:10:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:10:49,569 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-02-15 19:10:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:10:49,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2023-02-15 19:10:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:10:49,570 INFO L225 Difference]: With dead ends: 28 [2023-02-15 19:10:49,570 INFO L226 Difference]: Without dead ends: 20 [2023-02-15 19:10:49,571 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-15 19:10:49,572 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:10:49,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:10:49,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-15 19:10:49,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-02-15 19:10:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:10:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-02-15 19:10:49,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2023-02-15 19:10:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:10:49,577 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-02-15 19:10:49,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-15 19:10:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-02-15 19:10:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 19:10:49,578 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:10:49,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:10:49,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:10:49,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:10:49,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:10:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2023-02-15 19:10:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:10:49,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989663962] [2023-02-15 19:10:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:10:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:50,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:10:50,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989663962] [2023-02-15 19:10:50,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989663962] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:10:50,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408670833] [2023-02-15 19:10:50,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:50,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:10:50,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:10:50,103 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-15 19:10:50,104 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-15 19:10:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:50,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 19:10:50,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:10:50,246 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-15 19:10:50,253 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-15 19:10:50,288 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-15 19:10:50,388 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-15 19:10:50,479 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 51 treesize of output 23 [2023-02-15 19:10:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:50,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:10:50,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:10:50,702 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 28 treesize of output 29 [2023-02-15 19:10:50,706 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:10:50,707 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 26 treesize of output 18 [2023-02-15 19:10:50,712 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 22 treesize of output 10 [2023-02-15 19:10:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:50,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408670833] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:10:50,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:10:50,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2023-02-15 19:10:50,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396333371] [2023-02-15 19:10:50,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:10:50,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 19:10:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:10:50,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 19:10:50,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2023-02-15 19:10:50,750 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 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-15 19:10:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:10:51,171 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-02-15 19:10:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 19:10:51,173 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 19:10:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:10:51,173 INFO L225 Difference]: With dead ends: 37 [2023-02-15 19:10:51,173 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 19:10:51,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 19:10:51,175 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 89 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:10:51,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 28 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:10:51,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 19:10:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-02-15 19:10:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:10:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-15 19:10:51,179 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2023-02-15 19:10:51,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:10:51,179 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-15 19:10:51,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 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-15 19:10:51,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-15 19:10:51,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 19:10:51,179 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:10:51,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:10:51,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 19:10:51,380 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-15 19:10:51,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:10:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:10:51,381 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2023-02-15 19:10:51,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:10:51,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836960260] [2023-02-15 19:10:51,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:51,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:10:51,391 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:10:51,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [10812280] [2023-02-15 19:10:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:51,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:10:51,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:10:51,392 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-15 19:10:51,394 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-15 19:10:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:51,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 19:10:51,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:10:51,448 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-15 19:10:51,470 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-15 19:10:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:51,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:10:51,496 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-15 19:10:51,499 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-15 19:10:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:10:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836960260] [2023-02-15 19:10:51,506 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:10:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10812280] [2023-02-15 19:10:51,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10812280] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:10:51,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:10:51,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-02-15 19:10:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130980528] [2023-02-15 19:10:51,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:10:51,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 19:10:51,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:10:51,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 19:10:51,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:10:51,508 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:10:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:10:51,551 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-02-15 19:10:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:10:51,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 19:10:51,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:10:51,551 INFO L225 Difference]: With dead ends: 38 [2023-02-15 19:10:51,551 INFO L226 Difference]: Without dead ends: 26 [2023-02-15 19:10:51,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:10:51,552 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:10:51,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:10:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-15 19:10:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-15 19:10:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:10:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-02-15 19:10:51,557 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2023-02-15 19:10:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:10:51,557 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-02-15 19:10:51,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:10:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-02-15 19:10:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 19:10:51,558 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:10:51,558 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:10:51,565 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-15 19:10:51,762 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-15 19:10:51,763 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:10:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:10:51,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2023-02-15 19:10:51,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:10:51,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834989112] [2023-02-15 19:10:51,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:51,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:10:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:51,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:10:51,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834989112] [2023-02-15 19:10:51,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834989112] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:10:51,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490945466] [2023-02-15 19:10:51,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:10:51,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:10:51,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:10:51,817 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-15 19:10:51,819 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-15 19:10:51,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:10:51,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:10:51,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 19:10:51,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:10:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:51,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:10:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:51,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490945466] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:10:51,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:10:51,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 19:10:51,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236425415] [2023-02-15 19:10:51,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:10:51,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 19:10:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:10:51,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 19:10:51,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:10:51,927 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-15 19:10:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:10:52,024 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-15 19:10:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:10:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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 18 [2023-02-15 19:10:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:10:52,025 INFO L225 Difference]: With dead ends: 33 [2023-02-15 19:10:52,025 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 19:10:52,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 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-15 19:10:52,026 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:10:52,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:10:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 19:10:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2023-02-15 19:10:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:10:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-02-15 19:10:52,030 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2023-02-15 19:10:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:10:52,030 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-02-15 19:10:52,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-15 19:10:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-02-15 19:10:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 19:10:52,031 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:10:52,031 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:10:52,037 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-15 19:10:52,237 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-15 19:10:52,237 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:10:52,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:10:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2023-02-15 19:10:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:10:52,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644854541] [2023-02-15 19:10:52,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:10:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:52,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:10:52,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644854541] [2023-02-15 19:10:52,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644854541] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:10:52,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004531202] [2023-02-15 19:10:52,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:10:52,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:10:52,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:10:52,286 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-15 19:10:52,288 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-15 19:10:52,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 19:10:52,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:10:52,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 19:10:52,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:10:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:52,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:10:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:52,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004531202] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:10:52,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:10:52,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 19:10:52,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927007202] [2023-02-15 19:10:52,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:10:52,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 19:10:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:10:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 19:10:52,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:10:52,388 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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-15 19:10:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:10:52,438 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-02-15 19:10:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:10:52,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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) Word has length 19 [2023-02-15 19:10:52,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:10:52,439 INFO L225 Difference]: With dead ends: 37 [2023-02-15 19:10:52,439 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 19:10:52,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-15 19:10:52,439 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:10:52,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 21 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:10:52,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 19:10:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-02-15 19:10:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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-15 19:10:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-15 19:10:52,443 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2023-02-15 19:10:52,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:10:52,443 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-15 19:10:52,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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-15 19:10:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-15 19:10:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 19:10:52,443 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:10:52,444 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:10:52,450 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-15 19:10:52,648 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-15 19:10:52,648 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:10:52,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:10:52,649 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2023-02-15 19:10:52,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:10:52,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913990244] [2023-02-15 19:10:52,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:52,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:10:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:53,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:10:53,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913990244] [2023-02-15 19:10:53,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913990244] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:10:53,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622012858] [2023-02-15 19:10:53,101 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 19:10:53,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:10:53,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:10:53,103 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-15 19:10:53,105 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-15 19:10:53,148 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 19:10:53,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:10:53,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-15 19:10:53,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:10:53,156 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-15 19:10:53,160 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-15 19:10:53,165 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-15 19:10:53,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-15 19:10:53,257 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-15 19:10:53,320 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:10:53,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2023-02-15 19:10:53,379 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:10:53,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 28 [2023-02-15 19:10:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:53,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:10:54,572 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* 3 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (v_ArrVal_155 (Array Int Int))) (let ((.cse0 (select v_ArrVal_155 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4))))) (or (not (= 3 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_155))) (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 ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4))))) (or (< (+ .cse1 .cse2 .cse0) (+ .cse3 4)) (not (= 3 .cse1))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (v_ArrVal_155 (Array Int Int))) (let ((.cse6 (select v_ArrVal_155 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4))))) (or (not (= 3 .cse6)) (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_155))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4))))) (or (not (= 3 .cse7)) (< (+ .cse3 2) (+ .cse7 .cse8 .cse6))))))))))))) is different from false [2023-02-15 19:10:54,633 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* 3 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (v_ArrVal_155 (Array Int Int))) (let ((.cse0 (select v_ArrVal_155 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4))))) (or (not (= 3 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_155))) (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 ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4))))) (or (< (+ .cse1 .cse2 .cse0) (+ .cse3 7)) (not (= 3 .cse1))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (v_ArrVal_155 (Array Int Int))) (let ((.cse6 (select v_ArrVal_155 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4))))) (or (not (= 3 .cse6)) (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_155))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4))))) (or (< (+ .cse3 5) (+ .cse7 .cse8 .cse6)) (not (= 3 .cse7))))))))))))) is different from false [2023-02-15 19:10:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 19:10:54,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622012858] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:10:54,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:10:54,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 31 [2023-02-15 19:10:54,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982062785] [2023-02-15 19:10:54,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:10:54,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 19:10:54,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:10:54,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 19:10:54,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=705, Unknown=2, NotChecked=110, Total=930 [2023-02-15 19:10:54,672 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 31 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-15 19:10:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:10:55,299 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2023-02-15 19:10:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 19:10:55,301 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 31 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 21 [2023-02-15 19:10:55,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:10:55,301 INFO L225 Difference]: With dead ends: 40 [2023-02-15 19:10:55,301 INFO L226 Difference]: Without dead ends: 36 [2023-02-15 19:10:55,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=209, Invalid=1279, Unknown=2, NotChecked=150, Total=1640 [2023-02-15 19:10:55,302 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:10:55,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 61 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 300 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2023-02-15 19:10:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-15 19:10:55,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2023-02-15 19:10:55,306 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-15 19:10:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-02-15 19:10:55,306 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2023-02-15 19:10:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:10:55,306 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-02-15 19:10:55,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 31 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-15 19:10:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-02-15 19:10:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 19:10:55,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:10:55,307 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:10:55,316 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-15 19:10:55,514 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-15 19:10:55,514 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:10:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:10:55,515 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2023-02-15 19:10:55,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:10:55,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266826059] [2023-02-15 19:10:55,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:55,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:10:55,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:10:55,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899946949] [2023-02-15 19:10:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:10:55,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:10:55,525 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-15 19:10:55,527 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-15 19:10:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:55,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 19:10:55,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:10:55,598 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-15 19:10:55,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:10:55,637 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 16 treesize of output 18 [2023-02-15 19:10:55,660 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-15 19:10:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:55,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:10:55,696 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) 3)) is different from false [2023-02-15 19:10:55,702 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) is different from false [2023-02-15 19:10:55,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:10:55,711 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 24 treesize of output 25 [2023-02-15 19:10:55,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:10:55,716 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 38 treesize of output 34 [2023-02-15 19:10:55,718 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 7 treesize of output 3 [2023-02-15 19:10:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-02-15 19:10:55,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:10:55,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266826059] [2023-02-15 19:10:55,745 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:10:55,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899946949] [2023-02-15 19:10:55,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899946949] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:10:55,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:10:55,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-15 19:10:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176456372] [2023-02-15 19:10:55,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:10:55,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 19:10:55,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:10:55,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 19:10:55,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2023-02-15 19:10:55,746 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-15 19:10:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:10:55,888 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-02-15 19:10:55,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 19:10:55,889 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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 21 [2023-02-15 19:10:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:10:55,889 INFO L225 Difference]: With dead ends: 41 [2023-02-15 19:10:55,889 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 19:10:55,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=238, Unknown=2, NotChecked=66, Total=380 [2023-02-15 19:10:55,890 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:10:55,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 51 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2023-02-15 19:10:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 19:10:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-02-15 19:10:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:10:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-02-15 19:10:55,897 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2023-02-15 19:10:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:10:55,897 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-02-15 19:10:55,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-15 19:10:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-02-15 19:10:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 19:10:55,898 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:10:55,898 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:10:55,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 19:10:56,102 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-15 19:10:56,104 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:10:56,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:10:56,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2023-02-15 19:10:56,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:10:56,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101084306] [2023-02-15 19:10:56,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:56,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:10:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:56,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:10:56,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101084306] [2023-02-15 19:10:56,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101084306] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:10:56,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643558592] [2023-02-15 19:10:56,162 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 19:10:56,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:10:56,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:10:56,170 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-15 19:10:56,194 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-15 19:10:56,240 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-15 19:10:56,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:10:56,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 19:10:56,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:10:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:56,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:10:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:56,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643558592] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:10:56,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:10:56,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 19:10:56,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688882289] [2023-02-15 19:10:56,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:10:56,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 19:10:56,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:10:56,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 19:10:56,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-15 19:10:56,331 INFO L87 Difference]: Start difference. First operand 33 states and 36 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-15 19:10:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:10:56,454 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-02-15 19:10:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 19:10:56,456 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 23 [2023-02-15 19:10:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:10:56,456 INFO L225 Difference]: With dead ends: 41 [2023-02-15 19:10:56,456 INFO L226 Difference]: Without dead ends: 37 [2023-02-15 19:10:56,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-02-15 19:10:56,457 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:10:56,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 27 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:10:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-15 19:10:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2023-02-15 19:10:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:10:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-02-15 19:10:56,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2023-02-15 19:10:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:10:56,462 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-02-15 19:10:56,462 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-15 19:10:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-02-15 19:10:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 19:10:56,462 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:10:56,462 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:10:56,472 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-15 19:10:56,666 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-15 19:10:56,667 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:10:56,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:10:56,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 6 times [2023-02-15 19:10:56,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:10:56,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879443317] [2023-02-15 19:10:56,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:56,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:10:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:56,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:10:56,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879443317] [2023-02-15 19:10:56,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879443317] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:10:56,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515787505] [2023-02-15 19:10:56,725 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 19:10:56,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:10:56,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:10:56,726 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-15 19:10:56,728 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-15 19:10:56,776 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-15 19:10:56,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:10:56,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 19:10:56,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:10:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:56,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:10:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:56,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515787505] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:10:56,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:10:56,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 19:10:56,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293129848] [2023-02-15 19:10:56,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:10:56,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 19:10:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:10:56,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 19:10:56,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-15 19:10:56,861 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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-15 19:10:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:10:56,930 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2023-02-15 19:10:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 19:10:56,930 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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) Word has length 24 [2023-02-15 19:10:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:10:56,931 INFO L225 Difference]: With dead ends: 45 [2023-02-15 19:10:56,931 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 19:10:56,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-02-15 19:10:56,932 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:10:56,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:10:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 19:10:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2023-02-15 19:10:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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-15 19:10:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-02-15 19:10:56,936 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2023-02-15 19:10:56,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:10:56,936 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-02-15 19:10:56,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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-15 19:10:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-02-15 19:10:56,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 19:10:56,936 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:10:56,937 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:10:56,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 19:10:57,141 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-15 19:10:57,142 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:10:57,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:10:57,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 7 times [2023-02-15 19:10:57,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:10:57,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559270702] [2023-02-15 19:10:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:10:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:10:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:57,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:10:57,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559270702] [2023-02-15 19:10:57,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559270702] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:10:57,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154413444] [2023-02-15 19:10:57,658 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 19:10:57,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:10:57,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:10:57,659 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-15 19:10:57,660 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-15 19:10:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:10:57,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-15 19:10:57,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:10:57,761 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-15 19:10:57,768 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-15 19:10:57,799 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-15 19:10:57,865 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-15 19:10:57,914 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-15 19:10:58,023 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-15 19:10:58,109 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:10:58,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2023-02-15 19:10:58,206 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:10:58,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2023-02-15 19:10:58,282 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:10:58,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2023-02-15 19:10:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:10:58,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:11:01,192 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:11:01,192 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 407 treesize of output 1 [2023-02-15 19:11:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:11:01,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154413444] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:11:01,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:11:01,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 15] total 43 [2023-02-15 19:11:01,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967593908] [2023-02-15 19:11:01,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:11:01,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-15 19:11:01,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:11:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-15 19:11:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1637, Unknown=1, NotChecked=0, Total=1806 [2023-02-15 19:11:01,196 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 43 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 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-15 19:11:10,646 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 [0, 1] [2023-02-15 19:11:14,791 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 [0, 1] [2023-02-15 19:11:19,029 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 [0, 1] [2023-02-15 19:11:21,049 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 [0, 1] [2023-02-15 19:11:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:11:23,460 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2023-02-15 19:11:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 19:11:23,460 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 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 26 [2023-02-15 19:11:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:11:23,461 INFO L225 Difference]: With dead ends: 48 [2023-02-15 19:11:23,461 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 19:11:23,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=464, Invalid=3954, Unknown=4, NotChecked=0, Total=4422 [2023-02-15 19:11:23,463 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 67 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 34 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:11:23,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 73 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 809 Invalid, 10 Unknown, 0 Unchecked, 10.1s Time] [2023-02-15 19:11:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 19:11:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2023-02-15 19:11:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:11:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-02-15 19:11:23,468 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2023-02-15 19:11:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:11:23,469 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-02-15 19:11:23,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 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-15 19:11:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-02-15 19:11:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 19:11:23,469 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:11:23,469 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:11:23,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-15 19:11:23,670 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-15 19:11:23,670 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:11:23,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:11:23,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2023-02-15 19:11:23,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:11:23,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270842236] [2023-02-15 19:11:23,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:11:23,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:11:23,680 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:11:23,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [515366938] [2023-02-15 19:11:23,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:11:23,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:11:23,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:11:23,682 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-15 19:11:23,688 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-15 19:11:23,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:11:23,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:11:23,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 19:11:23,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:11:23,783 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-15 19:11:23,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:11:23,835 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 16 treesize of output 18 [2023-02-15 19:11:23,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:11:23,859 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 16 treesize of output 18 [2023-02-15 19:11:23,885 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-15 19:11:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:11:23,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:11:23,920 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) 3)) is different from false [2023-02-15 19:11:23,925 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 8)) 3)) is different from false [2023-02-15 19:11:23,932 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 3)) is different from false [2023-02-15 19:11:23,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:11:23,938 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 24 treesize of output 25 [2023-02-15 19:11:23,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:11:23,942 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 38 treesize of output 34 [2023-02-15 19:11:23,958 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 7 treesize of output 3 [2023-02-15 19:11:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2023-02-15 19:11:24,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:11:24,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270842236] [2023-02-15 19:11:24,000 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:11:24,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515366938] [2023-02-15 19:11:24,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515366938] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:11:24,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:11:24,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-02-15 19:11:24,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465055798] [2023-02-15 19:11:24,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:11:24,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 19:11:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:11:24,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 19:11:24,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2023-02-15 19:11:24,002 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:11:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:11:24,208 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-02-15 19:11:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 19:11:24,208 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 19:11:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:11:24,209 INFO L225 Difference]: With dead ends: 49 [2023-02-15 19:11:24,209 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 19:11:24,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=380, Unknown=3, NotChecked=126, Total=600 [2023-02-15 19:11:24,210 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:11:24,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 74 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 247 Invalid, 0 Unknown, 71 Unchecked, 0.1s Time] [2023-02-15 19:11:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 19:11:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-02-15 19:11:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 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-15 19:11:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-02-15 19:11:24,229 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2023-02-15 19:11:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:11:24,230 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-02-15 19:11:24,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:11:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-02-15 19:11:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 19:11:24,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:11:24,230 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:11:24,235 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-15 19:11:24,435 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-15 19:11:24,435 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:11:24,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:11:24,436 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 8 times [2023-02-15 19:11:24,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:11:24,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516937840] [2023-02-15 19:11:24,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:11:24,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:11:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:11:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:11:24,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:11:24,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516937840] [2023-02-15 19:11:24,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516937840] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:11:24,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975385026] [2023-02-15 19:11:24,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:11:24,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:11:24,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:11:24,537 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-15 19:11:24,539 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-15 19:11:24,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:11:24,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:11:24,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 19:11:24,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:11:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:11:24,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:11:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:11:24,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975385026] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:11:24,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:11:24,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-15 19:11:24,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326618052] [2023-02-15 19:11:24,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:11:24,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 19:11:24,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:11:24,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 19:11:24,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-15 19:11:24,705 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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-15 19:11:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:11:24,890 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2023-02-15 19:11:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 19:11:24,891 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-15 19:11:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:11:24,891 INFO L225 Difference]: With dead ends: 49 [2023-02-15 19:11:24,891 INFO L226 Difference]: Without dead ends: 45 [2023-02-15 19:11:24,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-02-15 19:11:24,892 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:11:24,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 34 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:11:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-15 19:11:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2023-02-15 19:11:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 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-15 19:11:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2023-02-15 19:11:24,897 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2023-02-15 19:11:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:11:24,897 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2023-02-15 19:11:24,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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-15 19:11:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2023-02-15 19:11:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 19:11:24,897 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:11:24,897 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:11:24,904 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-15 19:11:25,102 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-15 19:11:25,102 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:11:25,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:11:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838205, now seen corresponding path program 9 times [2023-02-15 19:11:25,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:11:25,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626331154] [2023-02-15 19:11:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:11:25,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:11:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:11:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:11:25,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:11:25,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626331154] [2023-02-15 19:11:25,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626331154] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:11:25,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37204843] [2023-02-15 19:11:25,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:11:25,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:11:25,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:11:25,187 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-15 19:11:25,189 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-15 19:11:25,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-15 19:11:25,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:11:25,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 19:11:25,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:11:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:11:25,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:11:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:11:25,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37204843] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:11:25,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:11:25,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-15 19:11:25,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267141938] [2023-02-15 19:11:25,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:11:25,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 19:11:25,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:11:25,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 19:11:25,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-15 19:11:25,374 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 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-15 19:11:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:11:25,470 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2023-02-15 19:11:25,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 19:11:25,470 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 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-15 19:11:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:11:25,470 INFO L225 Difference]: With dead ends: 53 [2023-02-15 19:11:25,471 INFO L226 Difference]: Without dead ends: 35 [2023-02-15 19:11:25,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2023-02-15 19:11:25,471 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:11:25,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 24 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:11:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-15 19:11:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-02-15 19:11:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 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-15 19:11:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-02-15 19:11:25,476 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2023-02-15 19:11:25,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:11:25,476 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-02-15 19:11:25,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 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-15 19:11:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-02-15 19:11:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 19:11:25,477 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:11:25,477 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:11:25,483 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-15 19:11:25,683 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-15 19:11:25,683 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:11:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:11:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 10 times [2023-02-15 19:11:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:11:25,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953974638] [2023-02-15 19:11:25,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:11:25,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:11:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:11:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:11:26,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:11:26,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953974638] [2023-02-15 19:11:26,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953974638] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:11:26,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797074588] [2023-02-15 19:11:26,443 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 19:11:26,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:11:26,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:11:26,445 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-15 19:11:26,446 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-15 19:11:26,507 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 19:11:26,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:11:26,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 69 conjunts are in the unsatisfiable core [2023-02-15 19:11:26,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:11:26,514 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-15 19:11:26,517 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-15 19:11:26,542 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-15 19:11:26,571 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-15 19:11:26,601 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-15 19:11:26,630 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-15 19:11:26,778 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-15 19:11:26,914 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:11:26,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2023-02-15 19:11:27,091 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-15 19:11:27,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 57 [2023-02-15 19:11:27,332 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2023-02-15 19:11:27,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 72 [2023-02-15 19:11:27,516 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2023-02-15 19:11:27,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 41 [2023-02-15 19:11:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:11:27,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:11:49,965 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (* 3 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) |v_ULTIMATE.start_main_~i~0#1_148|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (< .cse0 |v_ULTIMATE.start_main_~i~0#1_146|) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_490 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_490))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_490 (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 3 .cse1)) (not (= 3 .cse2)) (not (= 3 .cse3)) (< (+ .cse3 .cse2 .cse4 .cse1 .cse5) (+ .cse6 7)) (not (= 3 .cse4)))))))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|)))))) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_149|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_149|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (< .cse0 |v_ULTIMATE.start_main_~i~0#1_146|) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_490 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_490))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select v_ArrVal_490 (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse13 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse12 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse9 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 3 .cse9)) (not (= 3 .cse10)) (not (= 3 .cse11)) (not (= 3 .cse12)) (< (+ .cse6 5) (+ .cse11 .cse10 .cse12 .cse9 .cse13)))))))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) |v_ULTIMATE.start_main_~i~0#1_148|)))))))) is different from false [2023-02-15 19:11:52,098 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (* 3 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) |v_ULTIMATE.start_main_~i~0#1_148|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (< .cse0 |v_ULTIMATE.start_main_~i~0#1_146|) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_490 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_490))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_490 (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 3 .cse1)) (not (= 3 .cse2)) (not (= 3 .cse3)) (< (+ .cse3 .cse2 .cse4 .cse1 .cse5) (+ .cse6 7)) (not (= 3 .cse4)))))))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|)))))) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_149|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_149|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (< .cse0 |v_ULTIMATE.start_main_~i~0#1_146|) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_490 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_490))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select v_ArrVal_490 (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse13 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse12 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse9 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 3 .cse9)) (not (= 3 .cse10)) (not (= 3 .cse11)) (not (= 3 .cse12)) (< (+ .cse6 5) (+ .cse11 .cse10 .cse12 .cse9 .cse13)))))))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) |v_ULTIMATE.start_main_~i~0#1_148|)))))))) is different from false [2023-02-15 19:11:54,239 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse6 (* 3 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_149|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) |v_ULTIMATE.start_main_~i~0#1_148|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (< .cse0 |v_ULTIMATE.start_main_~i~0#1_146|) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_490 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_490))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_490 (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (< (+ .cse1 .cse2 .cse3 .cse4 .cse5) (+ .cse6 10)) (not (= 3 .cse4)) (not (= 3 .cse2)) (not (= 3 .cse1)) (not (= 3 .cse3)))))))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|)))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (< .cse0 |v_ULTIMATE.start_main_~i~0#1_146|) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_490 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_490))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select v_ArrVal_490 (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse13 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse12 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse9 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 3 .cse9)) (not (= 3 .cse10)) (not (= 3 .cse11)) (not (= 3 .cse12)) (< (+ .cse6 8) (+ .cse11 .cse10 .cse12 .cse9 .cse13)))))))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) |v_ULTIMATE.start_main_~i~0#1_148|)))) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_149|)))))) is different from false [2023-02-15 19:11:56,395 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse5 (* 3 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (< .cse0 |v_ULTIMATE.start_main_~i~0#1_146|) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_490 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_490))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_490 (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 3 .cse1)) (not (= 3 .cse2)) (not (= 3 .cse3)) (not (= 3 .cse4)) (< (+ .cse5 8) (+ .cse3 .cse2 .cse4 .cse1 .cse6)))))))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) |v_ULTIMATE.start_main_~i~0#1_148|)))) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_149|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (< .cse0 |v_ULTIMATE.start_main_~i~0#1_146|) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_490 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_490))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select v_ArrVal_490 (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse13 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse12 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse9 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 3 .cse9)) (< (+ .cse10 .cse11 .cse12 .cse9 .cse13) (+ .cse5 10)) (not (= 3 .cse11)) (not (= 3 .cse10)) (not (= 3 .cse12)))))))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) |v_ULTIMATE.start_main_~i~0#1_148|)))) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_149|)))))) is different from false [2023-02-15 19:11:58,532 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (+ |c_ULTIMATE.start_main_~i~0#1| 3))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) |v_ULTIMATE.start_main_~i~0#1_148|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_490 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_490))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_490 (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 3 .cse0)) (not (= 3 .cse1)) (not (= 3 .cse2)) (not (= 3 .cse3)) (< (+ .cse2 .cse1 .cse3 .cse0 .cse4) (+ .cse5 13)))))))))) (< .cse8 |v_ULTIMATE.start_main_~i~0#1_146|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|)))))) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_149|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) |v_ULTIMATE.start_main_~i~0#1_148|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_490 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_490))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select v_ArrVal_490 (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse13 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse12 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse9 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 3 .cse9)) (not (= 3 .cse10)) (not (= 3 .cse11)) (not (= 3 .cse12)) (< (+ .cse5 11) (+ .cse11 .cse10 .cse12 .cse9 .cse13)))))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (< .cse8 |v_ULTIMATE.start_main_~i~0#1_146|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|)))))) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_149|)))))) is different from false [2023-02-15 19:11:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2023-02-15 19:11:58,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797074588] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:11:58,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:11:58,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 24] total 63 [2023-02-15 19:11:58,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080708700] [2023-02-15 19:11:58,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:11:58,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-02-15 19:11:58,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:11:58,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-02-15 19:11:58,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=3039, Unknown=9, NotChecked=580, Total=3906 [2023-02-15 19:11:58,705 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 63 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 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-15 19:12:06,893 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:12:15,440 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 110 DAG size of output: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:12:28,129 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 110 DAG size of output: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:12:52,682 WARN L233 SmtUtils]: Spent 21.04s on a formula simplification. DAG size of input: 156 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:12:54,698 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-15 19:13:17,625 WARN L233 SmtUtils]: Spent 18.47s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:13:20,241 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-15 19:13:22,754 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-15 19:13:24,759 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-15 19:13:26,809 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-15 19:13:28,860 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 [0, 1] [2023-02-15 19:13:31,273 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 [0, 1] [2023-02-15 19:13:38,195 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 [0, 1] [2023-02-15 19:13:40,565 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-15 19:13:46,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:13:50,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-02-15 19:13:53,151 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-15 19:13:55,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:14:09,596 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-15 19:14:11,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:14:23,561 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-15 19:14:26,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:14:28,883 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-15 19:14:31,218 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-15 19:14:33,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:14:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:14:33,257 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2023-02-15 19:14:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-02-15 19:14:33,257 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 19:14:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:14:33,259 INFO L225 Difference]: With dead ends: 85 [2023-02-15 19:14:33,259 INFO L226 Difference]: Without dead ends: 74 [2023-02-15 19:14:33,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2657 ImplicationChecksByTransitivity, 139.7s TimeCoverageRelationStatistics Valid=1115, Invalid=10014, Unknown=21, NotChecked=1060, Total=12210 [2023-02-15 19:14:33,261 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 97 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 148 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:14:33,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 113 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1125 Invalid, 19 Unknown, 318 Unchecked, 45.3s Time] [2023-02-15 19:14:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-15 19:14:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2023-02-15 19:14:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 66 states have internal predecessors, (81), 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-15 19:14:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2023-02-15 19:14:33,276 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 31 [2023-02-15 19:14:33,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:14:33,277 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-02-15 19:14:33,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 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-15 19:14:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2023-02-15 19:14:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 19:14:33,277 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:14:33,278 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:14:33,282 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-15 19:14:33,482 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-15 19:14:33,482 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:14:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:14:33,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 3 times [2023-02-15 19:14:33,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:14:33,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507616859] [2023-02-15 19:14:33,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:14:33,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:14:33,489 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:14:33,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [80315648] [2023-02-15 19:14:33,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:14:33,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:14:33,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:14:33,490 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-15 19:14:33,492 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-15 19:14:33,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-15 19:14:33,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:14:33,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 19:14:33,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:14:33,587 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-15 19:14:33,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:33,646 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 18 treesize of output 20 [2023-02-15 19:14:33,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:33,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 18 treesize of output 20 [2023-02-15 19:14:33,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:33,700 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 18 treesize of output 20 [2023-02-15 19:14:33,725 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:14:33,725 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 23 treesize of output 19 [2023-02-15 19:14:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 19:14:33,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:14:35,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:14:35,039 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 27 treesize of output 28 [2023-02-15 19:14:35,045 INFO L321 Elim1Store]: treesize reduction 10, result has 28.6 percent of original size [2023-02-15 19:14:35,045 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 44 treesize of output 31 [2023-02-15 19:14:35,048 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 14 treesize of output 7 [2023-02-15 19:14:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 19:14:37,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:14:37,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507616859] [2023-02-15 19:14:37,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:14:37,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80315648] [2023-02-15 19:14:37,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80315648] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:14:37,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:14:37,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2023-02-15 19:14:37,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373669805] [2023-02-15 19:14:37,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:14:37,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 19:14:37,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:14:37,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 19:14:37,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=197, Unknown=5, NotChecked=0, Total=272 [2023-02-15 19:14:37,074 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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-15 19:14:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:14:37,206 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2023-02-15 19:14:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 19:14:37,206 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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) Word has length 31 [2023-02-15 19:14:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:14:37,207 INFO L225 Difference]: With dead ends: 75 [2023-02-15 19:14:37,207 INFO L226 Difference]: Without dead ends: 71 [2023-02-15 19:14:37,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=132, Invalid=283, Unknown=5, NotChecked=0, Total=420 [2023-02-15 19:14:37,207 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:14:37,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:14:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-15 19:14:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2023-02-15 19:14:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 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-15 19:14:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2023-02-15 19:14:37,234 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 31 [2023-02-15 19:14:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:14:37,235 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2023-02-15 19:14:37,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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-15 19:14:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2023-02-15 19:14:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 19:14:37,236 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:14:37,236 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:14:37,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 19:14:37,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:14:37,437 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:14:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:14:37,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 11 times [2023-02-15 19:14:37,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:14:37,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356476272] [2023-02-15 19:14:37,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:14:37,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:14:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:14:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:14:37,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:14:37,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356476272] [2023-02-15 19:14:37,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356476272] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:14:37,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831372337] [2023-02-15 19:14:37,545 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 19:14:37,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:14:37,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:14:37,547 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:14:37,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 19:14:37,623 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-15 19:14:37,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:14:37,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 19:14:37,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:14:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:14:37,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:14:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:14:37,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831372337] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:14:37,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:14:37,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-02-15 19:14:37,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334196355] [2023-02-15 19:14:37,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:14:37,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 19:14:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:14:37,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 19:14:37,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-02-15 19:14:37,820 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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-15 19:14:38,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:14:38,046 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2023-02-15 19:14:38,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 19:14:38,047 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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 33 [2023-02-15 19:14:38,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:14:38,047 INFO L225 Difference]: With dead ends: 85 [2023-02-15 19:14:38,047 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 19:14:38,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2023-02-15 19:14:38,048 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:14:38,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 36 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:14:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 19:14:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2023-02-15 19:14:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:14:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2023-02-15 19:14:38,064 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 33 [2023-02-15 19:14:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:14:38,064 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2023-02-15 19:14:38,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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-15 19:14:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2023-02-15 19:14:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 19:14:38,067 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:14:38,067 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:14:38,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-02-15 19:14:38,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 19:14:38,272 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:14:38,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:14:38,272 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 12 times [2023-02-15 19:14:38,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:14:38,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595457328] [2023-02-15 19:14:38,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:14:38,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:14:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:14:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:14:39,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:14:39,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595457328] [2023-02-15 19:14:39,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595457328] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:14:39,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607570010] [2023-02-15 19:14:39,043 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 19:14:39,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:14:39,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:14:39,045 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:14:39,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 19:14:39,135 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-02-15 19:14:39,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:14:39,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-15 19:14:39,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:14:39,218 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-15 19:14:39,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:39,253 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-15 19:14:39,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:39,266 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-15 19:14:39,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:39,278 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-15 19:14:39,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:39,288 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-15 19:14:39,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:39,304 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-15 19:14:39,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:39,399 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-15 19:14:39,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:39,533 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 19:14:39,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 37 [2023-02-15 19:14:39,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:39,717 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 19:14:39,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 51 [2023-02-15 19:14:39,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:39,923 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2023-02-15 19:14:39,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 63 [2023-02-15 19:14:40,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:40,173 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-02-15 19:14:40,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 78 [2023-02-15 19:14:40,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:14:40,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:14:40,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 41 [2023-02-15 19:14:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 19:14:40,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:14:47,800 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:14:47,800 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 1717 treesize of output 1 [2023-02-15 19:14:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 19:14:47,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607570010] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:14:47,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:14:47,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 22] total 65 [2023-02-15 19:14:47,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743708393] [2023-02-15 19:14:47,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:14:47,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-15 19:14:47,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:14:47,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-15 19:14:47,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3843, Unknown=0, NotChecked=0, Total=4160 [2023-02-15 19:14:47,805 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 65 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 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)